Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The Truck Dispatching Problem

The Truck Dispatching Problem 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Management Science INFORMS

The Truck Dispatching Problem

Dantzig, G. B.; Ramser, J. H.
Management Science , Volume 6 (1): 12 – Oct 1, 1959
Download PDF
13 pages

Loading next page...
 
/lp/informs/the-truck-dispatching-problem-0dS5bzBWnR

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Research Article
ISSN
0025-1909
eISSN
1526-5501
DOI
10.1287/mnsc.6.1.80
Publisher site
See Article on Publisher Site

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.

Journal

Management Science – INFORMS

Published: Oct 1, 1959

There are no references for this article.