Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (8): 1892-1896.

• 系统工程 • 上一篇    下一篇

不可行染色体转换方法

王林平1,2, 贾振元1, 王福吉1, 赵国凯1   

  1. 1. 大连理工大学精密与特种加工教育部重点实验室, 辽宁, 大连, 116024;
    2. 烟台大学机电汽车工程学院, 山东, 烟台, 264005
  • 收稿日期:2008-07-30 修回日期:2009-04-20 出版日期:2009-08-20 发布日期:2010-01-03
  • 作者简介:王林平(1963- ),男,副教授,博士,主要研究方向为计算机集成制造系统、复杂产品设计、制造企业信息化、生产调度等.E-mail:qutinwlp@yahoo.com.cn
  • 基金资助:
    国家高技术研究发展计划(863计划)(2003AA414022)资助课题

Methods of infeasible chromosome conversion

WANG Lin-ping1,2, JIA Zhen-yuan1, WANG Fu-ji1, ZHAO Guo-kai1   

  1. 1. Key Lab. for Precision and Non-traditional Machining Technology of Ministry of Education, Dalian Univ. of Technology, Dalian 116024, China;
    2. School of Electromechanical Automobile Engineering, Yantai Univ., Yantai 264005, China
  • Received:2008-07-30 Revised:2009-04-20 Online:2009-08-20 Published:2010-01-03

摘要: 染色体转换方法是遗传算法求解约束严组合优化问题的重要途径.探讨了转换方法设计及其性能问题,提出了对染色体转换方法的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.

中图分类号: