Abstract
Genetic algorithm (GA) is a very useful method for the global search of large search space and has been applied to various problems. It has two kinds of important search mechanisms, crossover and mutation. Because the performance of GA depends on these operators, a large number of operators have been developed for improving the performance of GA. Especially many researchers have more interested in crossover operator than mutation operator because crossover operator has charge of the responsibility of local search. We only deal with crossover operator.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Soak, SM., Ahn, BH. (2003). New Subtour-Based Crossover Operator for the TSP. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_49
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive