基于多色集合的遗传算法优化求解

摘要

This paper combines the constraint model with the genetic algorithm to solve the problem of flexible job shop scheduling, puts forward the genetic algorithm of the constraint model based on the polychromatic sets. A Boolean matrix around the way is searched in encoding decoding and variable, the search process is made within effective range and the search scope is reduced.This not only ensures the conclusion that the solution is efficient, but also can improve the convergence rate of the optimal solution,simplify the calculation of fitness through searching a contour Boolean matrix around the way, and be convenient for computer programming.%结合约束模型和遗传算法求解柔性车间作业调度(flexible job shop scheduling,FJSS)问题,提出了基于多色集合约束模型的遗传算法,在编码、解码和变异时搜索围道布尔矩阵,使搜索过程在有效范围内进行,从而缩小搜索范围,既保证了得出的解都是有效解,又能提高收敛到最优解的速度；通过搜索围道布尔矩阵简化了适应度的计算,方便了计算机的编程.