基于优先权值编码的3个体交叉的遗传算法  

A Genetic Algorithm Based on Three-Individual-Crossover and Preference Weight Coding

作　　者：孙金领[1] 常桂娟[1] 张好治[1] 徐英[1] 

机构地区：[1]青岛农业大学理学院,山东青岛266109

出　　处：《青岛农业大学学报（自然科学版）》2008年第1期73-76,共4页Journal of Qingdao Agricultural University(Natural Science)

基　　金：国家自然科学基金(70671057)

摘　　要：提出了基于优先权值编码结合3个体交叉的遗传算法。该编码方法不仅满足作业车间调度问题(Job-shop Scheduling Problem,JSP)中工序优先约束的要求,而且可以有效避免非可行解的产生,从而使得遗传算法(Genetic Algorithm,GA)应用于实际问题的过程更加简单、直接。3个体交叉的交叉算子在保证后代群体多样性的前提下,很好地继承了父代的优良特性,加快了收敛速度。仿真实验结果表明该算法对求解作业车间调度的有效性,仿真结果令人满意。This paper presented a genetic algorithm based on the combination of a preference weight coding and a three - individual - crossover. This coding method not only met the demand of operational preferential constraint in the JSP problem but also effectively avoided unfeasible solutions, which caused the process that GA was applied to the practical problem became simple and direct. Three - individual - crossover in guarantees under the great degree inherited excellent characteristics from parents premise enhanced the speed of convergence while guaranteeing the diversity of descendants. The simulation result showed that it was validity for the proposed algorithm for JSP problems. The results were satisfying.

关 键 词：遗传算法 作业车间调度问题 3个体交叉 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]