Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142201 | Operations Research Letters | 2014 | 5 Pages |
Abstract
This paper considers a multi-port and multi-period container planning problem of shipping companies that use both standard and foldable containers. A company must decide which number of empty containers of each type to purchase and reposition at each port within a defined period to minimize the total purchasing, repositioning, and storage costs.We develop a model to optimally allocate both foldable and standard containers. We show that a single commodity minimum cost network flow algorithm solves the problem by proving that a two commodity flow problem can be modeled as a single commodity flow problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Young-Soo Myung, Ilkyeong Moon,