Subtour preservation crossover operator for the symmetric travelling saleman problem

Subtour preservation crossover operator for the symmetric travelling saleman problem

0.00 Avg rating0 Votes
Article ID: iaor20082019
Country: South Korea
Volume: 33
Issue: 2
Start Page Number: 201
End Page Number: 212
Publication Date: Jun 2007
Journal: Journal of the Korean Institute of Industrial Engineers
Authors: , ,
Keywords: heuristics: genetic algorithms
Abstract:

Genetic algorithms (GAs) are very useful methods for global search and have been applied to various optimization problems. They have two kinds of important search mechanisms, crossover and mutation. Because the performance of GAs depends on these operators, a large number of operators have been developed for improving the performance of GAs. Especially, many researchers have been more interested in a crossover operator than a mutation operator. The reason is that a crossover operator is a main search operator in GAs and it has more effect on the search performance. So, we also focus on a crossover operator. In this paper we first investigate the drawback of various crossovers, especially subtour-based crossovers and then introduce a new crossover operator to avoid such drawback and to increase efficiency. Also we compare it with several crossover operators for symmetric traveling salesman problem for showing the performance of the proposed crossover. Finally, we introduce an efficient simple hybrid genetic algorithm using the proposed operator and then the quality and efficiency of the obtained results are discussed.

Reviews

Required fields are marked *. Your email address will not be published.