摘要
为克服传统遗传算法求解调度问题所存在的早熟或收敛过慢等不足,提出基于多色集合理论的改进遗传算法。在编码、解码和变异过程中,通过搜索围道矩阵提高算法速度,进而提高求解效率;采用单层编码方式表示调度问题中的双层约束,以降低算法的时间与空间复杂度。通过实例比较验证了所提算法的可行性与优越性。
To avoid premature or convergence of conventional genetic algorithm, an improved genetic algorithm based on polyehromatic sets theory was presented. In the process of encoding, decoding and mutation, by searching the contour matrix, 1he algorithm speed was improved therefore the solution e{ficiency 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）.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2011年第5期1004-1010,共7页
Computer Integrated Manufacturing Systems
基金
国家自然科学基金资助项目(11072192)
陕西省教育厅专项科研计划资助项目(09JK661)~~
关键词
多色集合理论
遗传算法
凋度
约束模型
polyehromatic sets theory
genetic algorithm
scheduling
constraint model
