计算机集成制造系统 ›› 2013, Vol. 19 ›› Issue (10): 2503-2509.

• 产品创新开发技术 • 上一篇    下一篇

求解双向无等待混合流水车间调度问题的粒子群优化算法

张其亮1,2,陈永生2   

  1. 1.江苏科技大学电气与信息工程学院
    2.同济大学电子与信息工程学院
  • 出版日期:2013-10-31 发布日期:2013-10-31
  • 基金资助:
    国家“十一五”科技支撑计划资助项目(115-04-YK-048)。

Particle swarm optimization algorithm for bi-directional no-wait hybrid flow shop problem

  • Online:2013-10-31 Published:2013-10-31
  • Supported by:
    Project supported by the 11th Five-Year Plan of National Science and Technology Program,China(No.115-04-YK-048).

摘要: 针对双向无等待混合流水车间调度问题,提出一种粒子群算法进行求解。算法采用排列形式进行编码,设计了插入—平移算法进行解码,解码过程利用处理时间最短优先策略选择加工机器,提出工件冲突的检测和化解方法,并利用粒子群算法进行全局优化。将该问题模型和求解算法应用于高速磁浮列车调度问题,仿真实例表明,所得模型和算法能够高效地求解高速磁浮列车调度问题。

关键词: 无等待混合流水车间调度问题, 高速磁浮列车调度, 粒子群优化算法

Abstract: Aiming at the Bi-Directional No-Wait Hybrid Flow Shop(BDNWHFS)problem,a Particle Swarm Optimization(PSO)algorithm was proposed.The permutation was used to code the algorithm,and the insert-shifting algorithm was designed to decode the algorithm.In decoding process,processing time Shortest First(PSF)strategy was adopted to select machines,and the conflict detection and resolution method were put forward.PSO algorithm was implemented for global optimization.The proposed model and algorithms were used to resolve high speed maglev train scheduling problem,and the experiments results showed that the model and algorithm could solve high speed maglev train scheduling problem effectively.

Key words: no-wait hybrid flow shop problem, high speed maglev train scheduling, particle swarm , optimization algorithm

中图分类号: