Genetic algorithms for the traveling salesman problem

Genetic algorithms for the traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor19971590
Country: Netherlands
Volume: 63
Issue: 1
Start Page Number: 339
End Page Number: 370
Publication Date: May 1996
Journal: Annals of Operations Research
Authors:
Keywords: heuristics
Abstract:

This paper is a survey of genetic algorithms for the traveling salesman problem. Genetic algorithms are randomized search techniques that simulate some of the processes observed in natural evolution. In this paper, a simple genetic algorithm is introduced, and various extensions are presented to solve the traveling salesman problem. Computational results are also reported for both random and classical problems taken from the operations research literature.

Reviews

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