Journal ArticleDOI
The Truck Dispatching Problem
George B. Dantzig,J. H. Ramser +1 more
TLDR
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.Abstract:
The paper is concerned with 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. The shortest routes between any two points in the system are given and a demand for one or several products is specified for a number of stations within the distribution system. It is desired to find a way to assign stations to trucks in such a manner that station demands are satisfied and total mileage covered by the fleet is a minimum A procedure based on a linear programming formulation is given for obtaining a near optimal solution. The calculations may be readily performed by hand or by an automatic digital computing machine. No practical applications of the method have been made as yet. A number of trial problems have been calculated, however.read more
Citations
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
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
A review of dynamic vehicle routing problems
TL;DR: This survey classifies routing problems from the perspective of information quality and evolution and presents a comprehensive review of applications and solution methods for dynamic vehicle routing problems.
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.
References
More filters
Book ChapterDOI
Solution of a Large-Scale Traveling-Salesman Problem
TL;DR: The RAND Corporation in the early 1950s contained Arrow, Bellman, Dantzig, Flood, Ford, Fulkerson, Gale, Johnson, Nash, Orchard-Hays, Robinson, Shapley, Simon, Wagner, and other household names as discussed by the authors.
Journal ArticleDOI
Discrete-Variable Extremum Problems
TL;DR: This paper reviews some recent successes in the use of linear programming methods for the solution of discrete-variable extremum problems and one example of the Use of the multistage approach of dynamic programming for this purpose is discussed.
Journal ArticleDOI
The Traveling-Salesman Problem
TL;DR: The traveling-salesman problem is that of finding a permutation P of the integers from 1 through n that minimizes the quantity A where the aαβ are a given set of real numbers.