The Traveling Salesman Problem

  • Zbigniew Michalewicz


In the next chapter, we present several examples of evolution programs tailored to specific applications (graph drawing, partitioning, scheduling). The traveling salesman problem (TSP) is just one of such applications; however, we treat it as a special problem — the mother of all problems — and discuss it in a separate chapter. What are the reasons?


Travel Salesman Problem Travel Salesman Problem Crossover Point Local Search Algorithm Conjunctive Normal Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Zbigniew Michalewicz
    • 1
  1. 1.Department of Computer ScienceUniversity of North CarolinaCharlotteUSA

Personalised recommendations