Abstract
In the previous chapters we have considered several heuristics for finding approximate solutions of traveling salesman problem instances. We have also shown how the use of candidate subgraphs can speed up computations enormously. There may be situations, however, where even these efficient implementations are too slow. If very restrictive real time constraints have to be observed, the methods derived so far may not be appropriate. In this chapter we address the question of finding traveling salesman tours for very large instances in short time. It is clear that we will have to accept some loss in quality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1994). Heuristics for Large Geometric Problems. In: The Traveling Salesman. Lecture Notes in Computer Science, vol 840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48661-5_8
Download citation
DOI: https://doi.org/10.1007/3-540-48661-5_8
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