期刊名称：International Journal on Computer Science and Engineering
印刷版ISSN：2229-5631
电子版ISSN：0975-3397
出版年度：2011
卷号：3
期号：05
页码：2019-2023
出版社：Engg Journals Publications
摘要：In this work Traveling salesperson problem is taken as Domain. TSP has long been known to be NP-complete and is a standard example of such problems. Genetic Algorithm (GA) is an approximate algorithm that doesn�t always aim to find the shortest tour but to find a reasonably short tour quickly, which is a search procedure inspired by the mechanisms of biological evolution. In genetic algorithms, crossovers are used as a main search operator for TSP. Briefly speaking: the role of crossovers is to generate offspring that are better tours by preserving partial tours from the parents. There were a lot attempts to discover an appropriate crossover operator. This paper presents the strategy which used to find the nearly optimized solution to these type of problems. It is the order crossover operator (OX) which was proposed by Davis, which constructs an offspring by choosing a subsequence of one parent and preserving the relative order of cities of the other parent.
关键词：Genetic algorithm; Travelling salesman problem; Order Crossover.
