The Truck Dispatching Problem |
您所在的位置:网站首页 › dispatching › The Truck Dispatching Problem |
来自
ideas.repec.org
喜欢
0
阅读量: 2361 作者: GB Dantzig,JH Ramser 展开 摘要: 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. 展开 DOI: 10.1287/mnsc.6.1.80 被引量: 5025 年份: 1959 |
今日新闻 |
推荐新闻 |
CopyRight 2018-2019 办公设备维修网 版权所有 豫ICP备15022753号-3 |