• 论文 •    

基于多色集合的改进遗传算法求解多品种柔性调度问题

傅卫平,刘冬梅,来春为,王雯   

  1. 1.西安理工大学 机械与精密仪器工程学院,陕西西安710048;2.西京学院 管理科学系,陕西西安710123
  • 出版日期:2011-05-15 发布日期:2011-05-25

Polychromatic-sets-based improved genetic algorithm for solving multi-species FJSP

FU Wei-ping, LIU Dong-mei, LAI Chun-wei, WANG Wen   

  1. 1.School of Mechanical and Precision Instrument Engineering, Xi'an University of Technology, Xi'an 710048, China;2.Department of Management, Xijing University, Xi'an 710123, China
  • Online:2011-05-15 Published:2011-05-25

摘要: 为克服传统遗传算法求解调度问题所存在的早熟或收敛过慢等不足,提出基于多色集合理论的改进遗传算法。在编码、解码和变异过程中,通过搜索围道矩阵提高算法速度,进而提高求解效率;采用单层编码方式表示调度问题中的双层约束,以降低算法的时间与空间复杂度。通过实例比较验证了所提算法的可行性与优越性。

关键词: 多色集合理论, 遗传算法, 调度, 约束模型

Abstract: To avoid premature or convergence of conventional genetic algorithm, an improved genetic algorithm based on polychromatic sets theory was presented. In the process of encoding, decoding and mutation, by searching the contour matrix, the algorithm speed was improved therefore the solution efficiency was improved. Then, single encoding was used to represent the double-constrained scheduling problems to reduce time and space complexity of the improved genetic algorithm. Comparison of examples verified that the improved genetic algorithm was feasible and effective, which could be used to deal with Flexible Job-Shop Scheduling Problem (FJSP).

Key words: polychromatic sets theory, genetic algorithm, scheduling, constraint model

中图分类号: