期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2015
卷号：4
期号：2
页码：151
DOI：10.15680/IJIRSET.2015.0402022
出版社：S&S Publications
摘要：This paper proposes a modified Order crossover operator for genetic algorithm that generates highquality solutions to the Traveling Salesman Problem (TSP) effectively. As the main time consuming process ofcrossover operator and schemata preserving process in crossover is the hole filling done in Order Crossover operator,so if the swath size is not to be too long and also depending on the problem size then it might be proven to find nearoptimum solutions in effective and efficient manner. The Modified Order Crossover operator constructs an offspringfrom a pair of parents using the existing Order Crossover operator with the enhancement on swath length (the size of achromosome which is between two crossover sites). The efficiency of the Modified Order Crossover is compared asagainst some of the existing crossover operators; namely, Partially Mapped Crossover (PMX), Order Crossover (OX)& Cyclic Crossover (CX) for some benchmark TSPLIB instances. Experimental results suggest that the new crossoveroperator enabled improved results compared to the PMX, OX and CX for the five Travelling salesman problems tested.
关键词：Crossover Operator; Genetic algorithm; NP-complete; Order Crossover; Traveling salesman problem
