Summary
The Travelling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, with instance size the effort to find good solutions increases considerably. Here, we discuss a set of eight edge fixing heuristics to transform large TSP problems into smaller problems, which can be solved easily with existing algorithms. The edge fixing heuristics exploit properties of the TSP such as nearest neighbour relations or relative edge length. We argue, that after expanding a reduced tour back to the original instance, the result is nearly as good as applying the used solver to the original problem instance, but requires significantly less time to be achieved.
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
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fischer, T., Merz, P. (2008). Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges. In: Cotta, C., van Hemert, J. (eds) Recent Advances in Evolutionary Computation for Combinatorial Optimization. Studies in Computational Intelligence, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70807-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-70807-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70806-3
Online ISBN: 978-3-540-70807-0
eBook Packages: EngineeringEngineering (R0)