| 多构造蚁群优化求解置换流水车间调度问题 |
| |
| 引用本文： | 刘延风,刘三阳.多构造蚁群优化求解置换流水车间调度问题[J].计算机科学,2010,37(1):222-224. |
| |
| 作者姓名： | 刘延风 刘三阳 |
| |
| 作者单位： | 西安电子科技大学应用数学系,西安,710071 |
| |
| 摘 要： | 针对置换流水车间调度问题,提出了一种多构造蚁群优化求解算法。在该算法中,蚁群采用两种方式构造解,分别是基于NEH(Nawaz-Enscore-Ham,NEH)启发式算法和Rajendran启发式算法,并根据解的质量,自适应地调整两种构造方式在蚁群中所占的比例。对置换流水车间调度问题的基准问题测试表明,提出的算法是有效的。
|
| 关 键 词： | 多构造蚁群优化 置换流水车间调度 NEH启发式算法 Rajendran启发式算法 |
| 收稿时间： | 2/9/2009 12:00:00 AM |
| 修稿时间： | 2009/5/13 0:00:00 |
Multi-construction Ant Colony Optimization Algorithm for Permutation Flow Shop Scheduling |
| |
| LIU Yan-feng,LIU San-yang.Multi-construction Ant Colony Optimization Algorithm for Permutation Flow Shop Scheduling[J].Computer Science,2010,37(1):222-224. |
| |
| Authors: | LIU Yan-feng LIU San-yang |
| |
| Affiliation: | Department of Applied Mathematics/a>;Xidian University/a>;Xi'an 710071/a>;China |
| |
| Abstract: | A Multi Construction Ant Colony Optimization Algorithm for Permutation Flow Shop Scheduling was proposed.In this algorithm,solutions are constructed through two modes,which are based on Nawaz-Enscore-Ham heuristics and Rajendran heuristics respectively.Then the proportion of construction modes is adjusted adaptively according to quality of solution constructed.Simulation results and comparisons based on benchmarks demonstrate the effectiveness of the algorithm. |
| |
| Keywords: | Permutation flow shop scheduling Multi construction ant colony optimization NEH heuristics Rajendran heuristics |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
|
