TY  - JOUR
AB  - 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 dominant constraint;
(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.
VL  - 21
IS  - 7
SN  - 0960-0035
DO  - 10.1108/EUM0000000000397
UR  - https://doi.org/10.1108/EUM0000000000397
AU  - Haessler Robert W.
PY  - 1991
Y1  - 1991/01/01
TI  - Cost Minimisation of Multiple‐vehicle Shipments
T2  - International Journal of Physical Distribution & Logistics Management
PB  - MCB UP Ltd
SP  - 37
EP  - 41
Y2  - 2024/04/26
ER  -