Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

The Truck Dispatching Problem

G. B. Dantzig and J. H. Ramser
Management Science
Vol. 6, No. 1 (Oct., 1959), pp. 80-91
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/2627477
Page Count: 12
  • Download ($30.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
The Truck Dispatching Problem
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
80
    80
  • Thumbnail: Page 
81
    81
  • Thumbnail: Page 
82
    82
  • Thumbnail: Page 
83
    83
  • Thumbnail: Page 
84
    84
  • Thumbnail: Page 
85
    85
  • Thumbnail: Page 
86
    86
  • Thumbnail: Page 
87
    87
  • Thumbnail: Page 
88
    88
  • Thumbnail: Page 
89
    89
  • Thumbnail: Page 
90
    90
  • Thumbnail: Page 
91
    91