New genetic crossover operator for the TSP

Abstract

Genetic algorithm is very useful method for global search of large search space and has been applied to various problems. It has two kinds of important search mechanisms, crossover and mutation. Especially many researchers have more interested in crossover operator than mutation operator because crossover operator has charge of the responsibility of local search. In this paper we introduce a new crossover operator avoiding the drawback of conventional crossovers. We compare it to several crossover operators for travelling salesman problem (TSP) for showing the performance of proposed crossover.