| Article ID: | iaor1992807 |
| Country: | United Kingdom |
| Volume: | 21 |
| Start Page Number: | 37 |
| End Page Number: | 41 |
| Publication Date: | Dec 1991 |
| Journal: | International Journal of Physical Distribution & Logistics Management |
| Authors: | Haessler Robert W. |
| Keywords: | programming: linear |
The paper describes how an LP-based one-dimensional packing algorithm can be used to minimise costs in three different multiple-vehicle shipment planning problems. The three applications considered are: (1) shipping industrial trucks by container when weight is the dominat constriant, (2) shipping automotive parts in racks by truck when volume is the dominant constraint, and (3) shipping large rolls of paper in railcars of varying size with incentive rates when volume is the dominant constraint.