Journal ArticleDOI
The vehicle routing problem: An overview of exact and approximate algorithms
TLDR
In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed.About:
This article is published in European Journal of Operational Research.The article was published on 1992-06-25. It has received 1737 citations till now. The article focuses on the topics: Vehicle routing problem & Heuristic (computer science).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
A survey of scheduling problems with setup times or costs
TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.
A tabu search heuristic for the vehicle routing problem
TL;DR: Taburoute as mentioned in this paper is a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions, which considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route, and reinserting it into another route.
Journal ArticleDOI
A tabu search heuristic for the vehicle routing problem
TL;DR: Numerical tests on a set of benchmark problems indicate that tabu search outperforms the best existing heuristics, and TABUROUTE often produces the bes known solutions.
Journal ArticleDOI
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TL;DR: 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.
References
More filters
Journal ArticleDOI
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
G. Clarke,J. W. Wright +1 more
TL;DR: An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.
Journal ArticleDOI
Computer solutions of the traveling salesman problem
TL;DR: Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization 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.
A tabu search heuristic for the vehicle routing problem
TL;DR: Taburoute as mentioned in this paper is a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions, which considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route, and reinserting it into another route.
Journal ArticleDOI
A Heuristic Algorithm for the Vehicle-Dispatch Problem
TL;DR: The sweep algorithm generally produces results that are significantly better than those produced by Gaskell's savings approach and are generally slightly better than Christofides and Eilon's results; however, the sweep algorithm is not as computationally efficient as Gaskell’s and is slightly less so than Christ ofides andEilon's.