论文信息 - Technical Note - Cost/Completion-Date Tradeoffs in the Transportation Problem

Technical Note - Cost/Completion-Date Tradeoffs in the Transportation Problem

The transportation problem is reconsidered to include the objective of minimizing the date at which all shipments are completed, in addition to the usual objective of minimizing total shipping cost. After proposing an algorithm requiring reoptimization of the previously determined solution to obtain the next one, we offer an illustration and address the question of tradeoffs between the two objectives.

Theodore S. Glickman | Paul D. Berger

[1] Fred Glover,et al. A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems , 1974 .

[2] Gerald L. Thompson,et al. Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.

[3] Bernard Roy,et al. Problems and methods with multiple objective functions , 1971, Math. Program..

[4] James E. Kelley,et al. Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .

[5] Robert Garfinkel,et al. The bottleneck transportation problem , 1971 .

[6] Paul D. Berger. Command post movements for defense alerts , 1974, Z. Oper. Research.

[7] Peter L. Hammer,et al. Time‐minimizing transportation problems , 1969 .

[8] George B. Dantzig,et al. Linear programming and extensions , 1965 .