The Truck Dispatching Problem

G. B. Dantzig and J. H. Ramser
Additional contact information
G. B. Dantzig: The RAND Corporation, Santa Monica, California
J. H. Ramser: The Atlantic Refining Company, Philadelphia, Pennsylvania

Management Science, 1959, vol. 6, issue 1, 80-91

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.

Date: 1959
References: Add references at CitEc
Citations: View citations in EconPapers (377)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.6.1.80 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:6:y:1959:i:1:p:80-91

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().