順序問題における遺伝的交叉法に対ずる一考察

抄録

Crossover is one of the most important operators in genetic algorithms, on which the overall performance of the algorithms critically depends. In this paper, we review a variety of crossover operators proposed for sequencing problems, and analyze the relationship between characteristics of the operator and performance of the algorithm. From this analysis, we propose simple criteria for measuring the quality of crossover operators. Some computational analysis on single machine scheduling problem is then added to validate the effectiveness of the proposed criteria.