Impact of dynamic information on empty container repositioning in a seaport with uncertainties

This paper investigates the impact of dynamic information on empty container repositioning in a seaport with uncertainties. Discrete-time dynamic programming is used to formulate the problem and minimize the expected costs consisting of inventory, leasing, and repositioning costs over an infinite horizon. The value iteration algorithm is applied to evaluate the optimal policies under the different schemes depending on whether or not the dynamic information of demands and shipments is utilized. A full factorial experiment is designed to compare the relative performance of different policies, and shed light on which type of policies is appropriate in which situations so that the potential benefits and the required effort can be balanced.

[1]  L. Sennott.  Stochastic Dynamic Programming and the Control of Queueing Systems , 1998 .

[2]  K. Lai,et al.  Shipping Container Logistics and Allocation , 1995 .

[3]  R. Hall,et al.  Fleet sizing and empty equipment redistribution for center-terminal transportation networks , 1997 .

[4]  D.-P. Song,et al.  Characterizing optimal empty container reposition policy in periodic-review shuttle service systems , 2007, J. Oper. Res. Soc..

[5]  Michael H. Cole,et al.  Empty container management for intermodal transportation networks , 2002 .

[6]  Teodor Gabriel Crainic,et al.  Survey Paper - A Review of Empty Flows and Fleet Management Models in Freight Transportation , 1987, Transp. Sci..

[7]  Chuen-Yih Chen,et al.  A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem , 1998, Transp. Sci..

[8]  Jie Zhang,et al.  On cost-efficiency of the global container shipping network , 2005 .

[9]  Michel Gendreau,et al.  Dynamic and Stochastic Models for the Allocation of Empty Containers , 1993, Oper. Res..

[10]  D. Song,et al.  Empty Container Management in Cyclic Shipping Routes , 2008 .

[11]  Kin Keung Lai,et al.  Empty container management in a port with long-run average criterion , 2004, Math. Comput. Model..

[12]  Andrew Lim,et al.  A network flow based method for the distribution of empty containers , 2005 .

[13]  Henry Y. K. Lau,et al.  Immunity-based hybrid evolutionary algorithm for multi-objective optimization in global container repositioning , 2008, Eng. Appl. Artif. Intell..

[14]  S. Theofanis,et al.  Empty marine container logistics: facts, issues and management strategies , 2009 .

[15]  Ke Liu,et al.  Allocation of empty containers between multi-ports , 2007, Eur. J. Oper. Res..

[16]  C. M. Khoong,et al.  A DSS for empty container distribution planning , 1995, Decis. Support Syst..

[17]  Martin W. P. Savelsbergh,et al.  Global Intermodal Tank Container Management for the Chemical Industry , 2005 .

[18]  Teodor Gabriel Crainic,et al.  Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem , 2000, Parallel Comput..

[19]  Loo Hay Lee,et al.  An approximate dynamic programming approach for the empty container allocation problem , 2007 .