Article ID: | iaor20122604 |
Volume: | 62 |
Issue: | 3 |
Start Page Number: | 708 |
End Page Number: | 715 |
Publication Date: | Apr 2012 |
Journal: | Computers & Industrial Engineering |
Authors: | Kopfer Herbert, Yun Won-Young, Dang Quang-Vinh |
Keywords: | allocation: resources, heuristics: genetic algorithms, combinatorial optimization |
Owing to trade imbalance, shipping companies position empty containers between ports or depots periodically. The most difficult problem for positioning is that it is not possible to know the exact amounts of empty containers required in the future. The paper deals with the problem of positioning empty containers in a port area with multiple depots. Customer demands and returning containers in depots per unit time period are assumed to be serially‐correlated and dependent random variables. Three options are considered to prepare the required extent of positioning: positioning from other overseas ports, inland positioning between depots, and leasing. The policies for empty‐container management consist of three parts as follows: a coordinated, (