基于工序约束链编码的遗传算法求解产品综合调度问题

摘要

针对产品综合调度优化问题,提出一种基于工序约束链编码的遗传算法.该算法设计的编码方法,不但能准确体现产品工艺树中的工序约束关系,而且不会强加新的约束,保证了初始解空间的可行性和完备性;同时避免了分区编码方法存在强加约束和遗漏解空间的问题.针对交叉、变异操作产生不可行解的问题,设计了一种基于邻接矩阵的修复方法.实验测试结果验证了所提算法的有效性.%A genetic algorithm based on operation constraint chain coding was proposed to solve product comprehensive scheduling problems.The coding method designed in the algorithm might accurately reflect the operation constraint relations in product operation trees,and did not impose new constraints to ensure feasibility and completeness of initial solution spaces.At the same time,the problems of imposition constraints and omission of solution spaces were avoided in division coding methods.For the infeasible solution generated by crossover and mutation operations,a repair method was designed based on adjacency matrix.Experimental results verify effectiveness of the proposed algorithm.