求解Job Shop调度问题的改进遗传算法

文章在对JSP问题进行描述的基础上,提出了一种新的改进遗传算法。该算法针对遗传算法的弱点进行了一系列的改进：设计一个新的选择策略来避免早熟,引入了一个动态的交叉和变异概率以及兄弟竞争的策略来加快收敛速度和全局搜索能力。仿真计算表明了该算法的良好收敛性和有效性。

Improvements of the genetic algorism for the solution to JSP problems

This paper brings forward a new enhanced Genetic Algorithm on the basis of depicting JSP problem.A lot of the improvements have been done aimed at the defects of the Genetic Algorithm.The improvements include a new design of selection strategy to avoid prematurity,a dynamic strategy to decide the crossover and mutation probability and a competition between brothers for the better ability of convergence's speed and the whole search.Simulation experiment shows the good convergence and effectiveness of this algorithm.