Welcome to the InfoSci Platform
Reference Hub5
The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

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

Gilbert Laporte
Copyright: © 2010 |Volume: 1 |Issue: 2 |Pages: 11
ISSN: 1947-8569|EISSN: 1947-8577|EISBN13: 9781609604547|DOI: 10.4018/jsds.2010040104
Cite Article Cite Article

MLA

Laporte, Gilbert. "The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization." IJSDS vol.1, no.2 2010: pp.82-92. http://doi.org/10.4018/jsds.2010040104

APA

Laporte, G. (2010). The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization. International Journal of Strategic Decision Sciences (IJSDS), 1(2), 82-92. http://doi.org/10.4018/jsds.2010040104

Chicago

Laporte, Gilbert. "The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization," International Journal of Strategic Decision Sciences (IJSDS) 1, no.2: 82-92. http://doi.org/10.4018/jsds.2010040104

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.