中国机械工程 ›› 2013, Vol. 24 ›› Issue (24): 3380-3385.

• 智能制造 • 上一篇    下一篇

求解柔性作业车间调度问题的两阶段参数自适应蚁群算法

凌海峰;王西山   

  1. 合肥工业大学过程优化与智能决策教育部重点实验室,合肥,230009
  • 出版日期:2013-12-25 发布日期:2013-12-27
  • 基金资助:
    国家自然科学基金资助项目(71071047);安徽省自然科学基金资助项目(1208085MG120) 

A Two-stage Parameter Adaptive Ant Colony Algorithm for Flexible Job Shop Scheduling Problem

Ling Haifeng;Wang  Xishan   

  1. Key Lab of Process Optimization and Intelligent Decision-making,Ministry of Education,Hefei University of Technology, Hefei, 230009
  • Online:2013-12-25 Published:2013-12-27
  • Supported by:
    National Natural Science Foundation of China(No. 71071047);Anhui Provincial Natural Science Foundation of China(No. 1208085MG120)

摘要:

针对柔性作业车间调度问题,提出了一种新的两阶段蚁群算法求解方案。在算法前期,采用细菌觅食趋化聚类技术判断蚁群所处的状态,自适应调整蚁群算法的参数,使算法快速收敛到全局最优解附近;在算法后期,利用混沌的随机性和遍历性特点来调整参数,有利于算法跳出局部最优。实验结果验证了该两阶段法的有效性。

关键词: 柔性作业车间调度, 蚁群算法, 细菌觅食聚类算法, 混沌

Abstract:

A new two-stage ant colony algorithm was proposed to solve the flexible job shop scheduling problem. At the early stage of the algorithm, bacterial foraging chemotaxis based clustering technology was used to determine the state of ant colony, and the parameters of ant colony algorithm were adjusted adaptively to make the algorithm rapidly convergence to the nearly global optimal solution. At the late stage, the parameters were tuned based on the randomness and ergodicity of chaos, beneficial to jump out of local optima. Experimental results verify the effectiveness of the two stage method.

Key words: flexible job shop scheduling problem, ant colony algorithm, bacterial foraging clustering algorithm, chaos

中图分类号: