计算机科学 ›› 2010, Vol. 37 ›› Issue (1): 222-224.
• 人工智能 • 上一篇 下一篇
刘延风,刘三阳
出版日期:
发布日期:
LIU Yan-feng,LIU San-yang
Online:
Published:
摘要： 针对置换流水车间调度问题，提出了一种多构造蚁群优化求解算法。在该算法中，蚁群采用两种方式构造解，分别是基于NEH (Nawaz- Enscore-Ham, NEH)启发式算法和Rajendran启发式算法，并根据解的质量，自适应地调整两种构造方式在蚁群中所占的比例。对置换流水车间调度问题的基准问题测试表明，提出的算法是有效的。
关键词: 多构造蚁群优化，置换流水车间调度，NEH启发式算法，Rajendran启发式算法
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.
Key words: Permutation flow shop scheduling, Multi construction ant colony optimization, NEH heuristics, Rajendran heuristics
刘延风,刘三阳. 多构造蚁群优化求解置换流水车间调度问题[J]. 计算机科学, 2010, 37(1): 222-224. https://doi.org/
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. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2010/V37/I1/222
Cited
首页