• 论文 •    

求解柔性作业车间调度问题的遗传—蚁群算法

陈成,邢立宁   

  1. 国防科学技术大学 信息系统与管理学院,湖南长沙410073
  • 出版日期:2011-03-25 发布日期:2011-03-25

GA-ACO for solving flexible job shop scheduling problem

CHEN Cheng, XING Li-ning   

  1. College of Information System & Management, National University of Defense Technology, Changsha 410073, China
  • Online:2011-03-25 Published:2011-03-25

摘要: 为更有效地求解柔性作业车间调度问题,提出了一种遗传—蚁群算法,该算法采用遗传算法解决机器分配问题,采用蚁群算法解决工序排序问题。在算法的求解过程中,不断从前期优化中挖掘、学习知识,并采用已获得的知识指导后续优化过程。通过标准实例测试,验证了所提算法的有效性。

关键词: 柔性作业车间调度, 遗传算法, 蚁群算法, 知识

Abstract: To solve flexible job shop scheduling problem effectively, a hybrid approach which combined Genetic Algorithm(GA)with Ant Colony Optimization(ACO)was proposed. GA was applied to tackle machine assignment problem, while ACO was employed to deal with operation sequencing problem. In the solution process, knowledge was continuously learned from previous optimization process and then adopted to guide subsequent optimization. Effectiveness of the proposed algorithm was validated through an experiment.

Key words: flexible job shop scheduling, genetic algorithm, ant colony algorithm, knowledge

中图分类号: