The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

Gilbert Laporte
Additional contact information
Gilbert Laporte: HEC Montréal, Canada

International Journal of Strategic Decision Sciences (IJSDS), 2010, vol. 1, issue 2, 82-92

Abstract: The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.

Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jsds.2010040104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jsds00:v:1:y:2010:i:2:p:82-92

Access Statistics for this article

International Journal of Strategic Decision Sciences (IJSDS) is currently edited by Saeed Tabar

More articles in International Journal of Strategic Decision Sciences (IJSDS) from IGI Global
Bibliographic data for series maintained by Journal Editor ().