| 无等待流水线调度问题的混合优化算法 |
| |
| 引用本文： | 刘敏.无等待流水线调度问题的混合优化算法[J].上海第二工业大学学报,2009,26(1):6-11. |
| |
| 作者姓名： | 刘敏 |
| |
| 作者单位： | 上海第二工业大学计算机与信息学院,上海,201209 |
| |
| 基金项目： | 上海市教育委员会高校人才培养工程建设项目 |
| |
| 摘 要： | 针对无等待流水线调度问题提出了一种混合离散化粒子群优化算法。通过建立位置矢量编码与调度方案之间的映射关系将连续的粒子群优化算法应用于离散的无等待流水线工件调度问题。为了提高离散粒子群算法的性能，增强算法的探索能力，在粒子群每次迭代之后对全局最优解加入随机扰动并进行变邻域搜索。仿真结果表明，该优化算法具有良好的性能。
|
| 关 键 词： | 无等待流水线调度 离散粒子群优化算法 变邻域搜索 |
Hybrid Optimization Algorithm for No-Wait Flow Shops Scheduling |
| |
| LIU Min.Hybrid Optimization Algorithm for No-Wait Flow Shops Scheduling[J].Journal of Shanghai Second Polytechnic University,2009,26(1):6-11. |
| |
| Authors: | LIU Min |
| |
| Affiliation: | School of Computer and Information;Shanghai Second Polytechnic University;Shanghai 201209;P.R.China |
| |
| Abstract: | In this paper,no-wait flow shops scheduling problems for a mixed discrete particle swarm optimization,through the establishment of the location of the vector encoding and scheduling program of mapping relations between the continuous particle swarm optimization algorithm is applied to discrete no-wait flow shops scheduling problem.In order to improve the discrete PSO performance,enhanced ability to explore algorithm in particle swarm after each iteration of the global optimal solution by adding random pertu... |
| |
| Keywords: | no-wait flow shops scheduling discrete particle swarm optimization variable neighborhood search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《上海第二工业大学学报》浏览原始摘要信息 |
|
点击此处可从《上海第二工业大学学报》下载全文 |
