计算机应用研究2011，Vol.28Issue(3)：859-861,3.DOI:10.3969/j.issn.1001-3695.2011.03.017
求解零空闲流水线调度问题的改进蚁群算法
Ant-colony heuristic algorithm for no-idle flow shop scheduling problem
摘要
Abstract
This paper proposed an advanced ant colony algorithm for no-idle flow shop problem (NIFS) with makespan criterion. Improved the pheromone density initialization and updating rules by using a hybrid heuristic strategy, adoped a new state transition rule to construct an ant-sequence. Then, presented an local search algorithm based on the speed-up technology for inserting neighborhood structure for overcoming algorithm into the local convergence. And the simulation experiments show that the presented algorithm is effective and superiority in finding optimal or near optimal solutions.关键词
蚁群算法/信息素密度/信息素更新规则/零空闲流水线调度/最大完工时间/邻域搜索分类
信息技术与安全科学引用本文复制引用
张风荣,段俊华,庞荣波,韩红燕..求解零空闲流水线调度问题的改进蚁群算法[J].计算机应用研究,2011,28(3):859-861,3.基金项目
华中科技大学数字制造装备与技术国家重点实验室开放课题 （）
中国博士后科学基金资助项目(20070410791) （20070410791）
