Journal
TRANSPORTATION SCIENCE
Volume 43, Issue 4, Pages 408-416Publisher
INFORMS
DOI: 10.1287/trsc.1090.0301
Keywords
vehicle routing problem; traveling salesman problem; exact algorithms; heuristics; metaheuristics; survey
Categories
Funding
- Canadian Natural Sciences and Engineering Research Council [05-39682]
Ask authors/readers for more resources
The Vehicle Routing Problem (VRP) was introduced 50 years ago by Dantzig and Ramser under the title The Truck Dispatching Problem. The study of the VRP has given rise to major developments in the fields of exact algorithms and heuristics. In particular, highly sophisticated exact mathematical programming decomposition algorithms and powerful metaheuristics for the VRP have been put forward in recent years. The purpose of this article is to provide a brief account of this development.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
