Models, relaxations and exact approaches for the capacitated vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TLDR
This paper reviews the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where only the vehicle capacity constraints are considered, and concludes by examining possible future directions of research in this field.About:
This article is published in Discrete Applied Mathematics.The article was published on 2002-11-15 and is currently open access. It has received 1019 citations till now. The article focuses on the topics: Branch and bound & Vehicle routing problem.read more
Citations
More filters
Book
Handbook of Constraint Programming
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Journal ArticleDOI
Location-routing: Issues, models and methods
Gábor Nagy,Said Salhi +1 more
TL;DR: This paper proposes a classification scheme and looks at a number of problem variants in location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects.
Journal ArticleDOI
The vehicle routing problem
TL;DR: This classification is the first to categorize the articles of the VRP literature to this level of detail and is based on an adapted version of an existing comprehensive taxonomy.
Journal ArticleDOI
Fifty Years of Vehicle Routing
TL;DR: In this article, the authors provide a brief account of the development in the field of exact algorithms and heuristics for the VRP and present a metaheuristic for the problem.
Fifty Years of Vehicle Routing
TL;DR: The Vehicle Routing Problem was introduced 50 years ago by Dantzig and Ramser under the title “The Truck Dispatching Problem” and has given rise to major developments in the fields of exact algorithms and heuristics.
References
More filters
Journal ArticleDOI
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
S. Lin,Brian W. Kernighan +1 more
TL;DR: This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems.
Book
Knapsack Problems: Algorithms and Computer Implementations
Silvano Martello,Paolo Toth +1 more
TL;DR: This paper focuses on the part of the knapsack problem where the problem of bin packing is concerned and investigates the role of computer codes in the solution of this problem.
MonographDOI
The vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TL;DR: In this paper, the authors present a comprehensive overview of the most important techniques proposed for the solution of hard combinatorial problems in the area of vehicle routing problems, focusing on a specific family of problems.
The traveling salesman problem
TL;DR: This study tested human performance on a real and virtual floor, as well as in a threedimensional (3D) virtual space, and modeled these results by a graph pyramid algorithm, which suggests that deterioration of performance in the 3D space can be attributed to geometrical relations between hierarchical clustering in a3D space and coarse-to-fine production of a tour.
Journal ArticleDOI
The vehicle routing problem: An overview of exact and approximate algorithms
TL;DR: In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed.