Journal ArticleDOI
A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme
R. A. Holmes,R. G. Parker +1 more
TLDR
An extension of previous work is developed and an algorithm is presented for the classical vehicle scheduling problem where a set of vehicles with known capacities are to service a known set of points with deterministic demands at least cost.Abstract:
This paper is concerned with the classical vehicle scheduling problem where a set of vehicles with known capacities are to service a known set of points with deterministic demands at least cost. An extension of previous work is developed and an algorithm is presented. Suitable computational experience with the procedure is provided for both the symmetric and the non-symmetric problems.read more
Citations
More filters
Journal ArticleDOI
Heuristic Methods Applied to Orienteering
TL;DR: A ‘good’, if not ‘optimal’ solution by means of an efficient and computationally feasible method is derived and discussed and this solution is obtained by the use of either of two algorithms based on approximate methods.
Journal ArticleDOI
The savings algorithm for the vehicle routing problem
TL;DR: Modifications of the savings method are presented which show less CPU time and reduced storage requirements, therefore, the Savings method can be implemented on microcomputers.
Journal ArticleDOI
On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics
TL;DR: This paper presents the SR-GCWS-CS probabilistic algorithm that combines Monte Carlo simulation with splitting techniques and the Clarke and Wright savings heuristic to find competitive quasi-optimal solutions to the Capacitated Vehicle Routing Problem (CVRP) in reasonable response times.
Journal ArticleDOI
The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem
TL;DR: The objective of this work is to present SR-GCWS, a hybrid algorithm that combines a CVRP classical heuristic with Monte Carlo simulation using state-of-the-art random number generators, able to compete or even outperform much more complex algorithms.
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
The Truck Dispatching Problem
George B. Dantzig,J. H. Ramser +1 more
TL;DR: A procedure based on a linear programming formulation is given for obtaining a near optimal solution to the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal.
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.
Journal ArticleDOI
An Algorithm for the Vehicle-dispatching Problem
Nicos Christofides,Samuel Eilon +1 more
TL;DR: The vehicle-scheduling problem involves the design of several vehicle tours to meet a given set of requirements for customers with known locations, subject to a capacity constraint for the vehicles and a distance constraint for vehicles.
Journal ArticleDOI
On an Integer Program for a Delivery Problem
TL;DR: In this paper, an actual truck delivery problem of general applicability is stated as an integer program and the successful computational performance of Gomory's "cutting plane" algorithm for a set of nine particular problems is discussed.
Related Papers (5)
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
G. Clarke,J. W. Wright +1 more