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

Previous Articles     Next Articles

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

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.

CLC Number: 

[an error occurred while processing this directive]