Journal ArticleDOI
Implementation techniques for the vehicle routing problem
TLDR
Six methods for implementing the widely used Clarke-Wright algorithm for the vehicle routing problem (VRP) are presented and compared and the results clearly establish methods of choice for VRP problems with given characteristics.About:
This article is published in Computers & Operations Research.The article was published on 1985-01-01. It has received 51 citations till now. The article focuses on the topics: Vehicle routing problem & Adjacency list.read more
Citations
More filters
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.
Journal ArticleDOI
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
TL;DR: Approximate methods based on descent, hybrid simulated annealing/tabu search, and tabu search algorithms are developed and different search strategies are investigated and an estimate for the tabu list size is statistically derived.
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
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
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.
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.
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.
Related Papers (5)
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
G. Clarke,J. W. Wright +1 more