Abstract
The Traveling Salesman Problem (TSP) is one of the most illustrious and extensively studied problems in the field of Combinatorial Optimization. Covering just the period from 1993 to mid-2001 alone, the web databases of INFORMS and Decision Sciences report more than 150 papers devoted to the TSP. The problem can be stated in graph theory terms as follows. Let G = (V, A) be a weighted complete graph, where V = {v 1,..., v n } is a vertex (node) set and A = {(v i , v j )¦v i , v j ∈ V,i ≠ j} is an edge set. C = [c(v i ,v j )] is a n * n matrix associated with A, where c(v i ,v j ) is a non-negative weight (distance or cost) on edge (v i ,v j ) if there is an edge between v i and v j . Otherwise c(v i ,v j ) is infinity.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Rego, C., Glover, F. (2007). Local Search and Metaheuristics. In: Gutin, G., Punnen, A.P. (eds) The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol 12. Springer, Boston, MA. https://doi.org/10.1007/0-306-48213-4_8
Download citation
DOI: https://doi.org/10.1007/0-306-48213-4_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-44459-8
Online ISBN: 978-0-306-48213-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)