Sign up & Download
Sign in

Genetic Algorithms and the Traveling Salesman Problem

by K Bryant
Annals of Operations Research ()

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.

Cite this document (BETA)

Readership Statistics

2 Readers on Mendeley
by Discipline
 
by Academic Status
 
50% Student (Bachelor)
 
50% Ph.D. Student
by Country
 
50% Germany

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Already have an account? Sign in