CAJ | 학술논문

针对传统遗传算法在求解作业车间调度问题时存在的算法收敛速度慢、寻优结果易陷入局部最优等缺点，提出了基于禁忌搜索算法的遗传交叉算子，采用MATLAB7.10编写程序，在pox交叉方法中加入禁忌功能，利用禁忌表对交叉过程重复产生的子代进行有效禁忌，以加快算法的收敛速度，提高算法的全局搜索能力。将提出的改进遗传算法应用于muth and Thompson′s基准问题，显示该算法在收敛速度和求解质量方面的有效性。
침대전통유전산법재구해작업차간조도문제시존재적산법수렴속도만、심우결과역함입국부최우등결점，제출료기우금기수색산법적유전교차산자，채용MATLAB7.10편사정서，재pox교차방법중가입금기공능，이용금기표대교차과정중복산생적자대진행유효금기，이가쾌산법적수렴속도，제고산법적전국수색능력。장제출적개진유전산법응용우muth and Thompson′s기준문제，현시해산법재수렴속도화구해질량방면적유효성。
Considering slow convergence speed and optimization results easy to fall into local optimum and other shortcomings when traditional genetic algorithm solves job shop scheduling problem, tabu search algo-rithm, based on genetic crossover, is proposed. In order to accelerate the convergence rate and improve the global search capability, write programs by MATLAB7. 10 and join taboo functional in pox cross, it taboos the offspring effectively, produced by the cross-process repeats, by the use of tabu list. applying improved genetic algorithm to Muth and Thompson’ s benchmark problem, we proved that the improved genetic algo-rithm is effective in the convergence speed and the quality of solution.