Abstract
In many practical applications it is required to find reasonably good tours for a traveling salesman problem in short time. When designing fast heuristics, one is faced with the problem that, in principle, very many connections need to be considered. For example, in the traveling salesman problem fnl4461, tours have to be constructed by selecting 4461 out of 9,948,030 possible connections. Standard implementations of heuristics consider all these connections which leads to substantial running times.
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.
Similar content being viewed by others
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1994). Candidate Sets. In: The Traveling Salesman. Lecture Notes in Computer Science, vol 840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48661-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-48661-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58334-9
Online ISBN: 978-3-540-48661-9
eBook Packages: Springer Book Archive