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

référence BibTeX

The Traveling Salesman Problem and the Vehicle Routing Problem are two of the most popular problems in the field of combinatorial optimization. The purpose of this paper is to show how their study has fostered the development of some of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.

, 14 pages

Axe de recherche

Application de recherche


The traveling salesman problem, the vehicle routing problem, and their impact on combinatorial optimization
International Journal of Strategic Decision Sciences, 1, 82–92, 2010 référence BibTeX