Abstract
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?
There is nothing worse for mortals than a wandering life.
Homer, Odyssey
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Michalewicz, Z. (1996). The Traveling Salesman Problem. In: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03315-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-03315-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08233-7
Online ISBN: 978-3-662-03315-9
eBook Packages: Springer Book Archive