| 刘长平,叶春明.求解置换流水车间调度问题的布谷鸟算法[J].上海理工大学学报,2013,35(1):. |
| 求解置换流水车间调度问题的布谷鸟算法 |
| Cuckoo Search Algorithm for the Problem of Permutation Flow Shop Scheduling |
| |
| DOI： |
| 中文关键词: 置换流水车间调度 布谷鸟算法 优化机理 最大完工时间 |
| 英文关键词:permutation flow shop scheduling cuckoo search optimization mechanism makespan |
| 基金项目: |
|
| 摘要点击次数: 16924 |
| 全文下载次数: 18915 |
| 中文摘要: |
| 分析了布谷鸟算法的优化机理和特点,针对最小化最大完工时间的置换流水车间调度问题,采用基于最小位置值规则的随机键编码方式,应用布谷鸟算法进行求解.通过选取的标准算例对算法进行了仿真测试,并与萤火虫算法和粒子群算法进行对比,测试结果表明了该算法求解置换流水车间调度问题的有效性和优越性.该方法可作为解决流水线生产调度问题的一种有效方法. |
| 英文摘要: |
| Being inspired by the breeding behavior such as brood parasitism of cuckoos,the cuckoo search(CS) was proposed as a novel bionic swarm intelligence optimization method.The optimization mechanism and characteristics of CS were analyzed.Then,the proposed search strategy was applied to solve the minimization of makespan for the problem of permutation flow shop scheduling,adopting the code rule of randomized key representation based on the smallest position value.Comparing with the firefly algorithm and particle swarm optimization,simulation results of benchmark instances validate the efficiency and superiority of CS. |
| HTML 查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|
