| Article ID: | iaor20119902 |
| Volume: | 49 |
| Issue: | 2 |
| Start Page Number: | 109 |
| End Page Number: | 124 |
| Publication Date: | Sep 2011 |
| Journal: | INFOR: Information Systems and Operational Research |
| Authors: | Pisinger David, Spoorendonk Simon, Brouer Berit Dangaard |
| Keywords: | allocation: resources, combinatorial optimization, transportation: general, networks |
This paper is concerned with the cargo allocation problem considering empty repositioning of containers for a liner shipping company. The aim is to maximize the profit of transported cargo in a network, subject to the cost and availability of empty containers. The formulation is a multi‐commodity flow problem with additional inter‐balancing constraints to control repositioning of empty containers. In a study of the cost efficiency of the global container‐shipping network,