Paper
1 September 1993 Large ratios of mutation to crossover: the example of the traveling salesman problem
David John Nettleton, Roberto Garigliano
Author Affiliations +
Abstract
Genetic algorithms have recently been successfully applied to a wide range of problems. These often have search spaces that are very large, very complex, or both and are unsuitable for standard search algorithms such as hill climbing. The operators used in producing successive generations are usually those of crossover and mutation. The crossover operator is normally used in producing the majority of a generation while mutation acts as a background process. This paper examines the use of high amounts of mutation and gives the example of a genetic algorithm applied to the travelling salesman problem. This shows that high amounts of mutation need not ruin the algorithms convergence to optimal solutions.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
David John Nettleton and Roberto Garigliano "Large ratios of mutation to crossover: the example of the traveling salesman problem", Proc. SPIE 1962, Adaptive and Learning Systems II, (1 September 1993); https://doi.org/10.1117/12.150578
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Genetic algorithms

Binary data

Gallium

Adaptive control

Control systems

Evolutionary algorithms

Genetics

Back to Top