Cost Minimisation of Multiple‐vehicle Shipments

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.