【摘要】 染色体转换方法是遗传算法求解约束严组合优化问题的重要途径。探讨了转换方法设计及其性能问题,提出了对染色体转换方法的4项性能要求。在介绍综合作业调度问题(complete job shop scheduling problem,CJSSP)概念的基础上,设计了4种转换方法。实验结果表明,4种方法都是可行的,但具有明显不同的效率和质量,与观察结果和算法性能分析一致,为改进求解综合作业调度的遗传算法奠定了基础。更多还原

【Abstract】 Chromosome conversion is vital to genetic algorithm for solving tight-constraint combinatorial optimization problems.The conversion methods and their performances are explored.Four criteria are proposed to weigh conversion methods.Four conversion methods are designed after introducing the complete job shop scheduling problem(CJSSP).Computational results indicate that all methods are viable in application,different in conversion speed and quality,and consistent with observation and analytical conclusions.The methods also underlie modifying genetic algorithm for CJSSP.更多还原