The sample average approximation method for empty container repositioning with uncertainties

One of the challenges faced by liner operators today is to effectively operate empty containers in order to meet demand and to reduce inefficiency in an uncertain environment. To incorporate uncertainties in the operations model, we formulate a two-stage stochastic programming model with random demand, supply, ship weight capacity, and ship space capacity. The objective of this model is to minimize the expected operational cost for Empty Container Repositioning (ECR). To solve the stochastic programs with a prohibitively large number of scenarios, the Sample Average Approximation (SAA) method is applied to approximate the expected cost function. To solve the SAA problem, we consider applying the scenario aggregation by combining the approximate solution of the individual scenario problem. Two heuristic algorithms based on the progressive hedging strategy are applied to solve the SAA problem. Numerical experiments are provided to show the good performance of the scenario-based method for the ECR problem with uncertainties.

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

[2]  Martin W. P. Savelsbergh,et al.  Robust Optimization for Empty Repositioning Problems , 2009, Oper. Res..

[3]  Ruiyou Zhang,et al.  A reactive tabu search algorithm for the multi-depot container truck transportation problem , 2009 .

[4]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[5]  Antonio Manca,et al.  An Operational Model for Empty Container Management , 2005 .

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

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

[8]  João Luiz Becker,et al.  A DSS for integrated distribution of empty and full containers , 2009, Decis. Support Syst..

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

[10]  Akio Imai,et al.  The container shipping network design problem with empty container repositioning , 2007 .

[11]  Petros A. Ioannou,et al.  Port dynamic empty container reuse , 2006 .

[12]  Warren B. Powell,et al.  An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application , 2009, Transp. Sci..

[13]  Petros A. Ioannou,et al.  A heuristic solution for the empty container substitution problem , 2008 .

[14]  Stefan Voß,et al.  Container terminal operation and operations research - a classification and literature review , 2004, OR Spectr..

[15]  Dong-Ping Song,et al.  Quantifying the impact of inland transport times on container fleet sizing in liner shipping services with uncertainties , 2012, OR Spectr..

[16]  Bin Wang,et al.  Research on the Optimization of Intermodal Empty Container Reposition of Land-carriage , 2007 .

[17]  Alexander Shapiro,et al.  The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..

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

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

[20]  Xue-Ming Yuan,et al.  A Tactical Planning Model for Liner Shipping Companies : Managing Container Flow and Ship Deployment Jointly , 2007 .

[21]  Akio Imai,et al.  Multi-port vs. Hub-and-Spoke port calls by containerships , 2009 .

[22]  R. Tyrrell Rockafellar,et al.  Scenarios and Policy Aggregation in Optimization Under Uncertainty , 1991, Math. Oper. Res..

[23]  Ilkyeong Moon,et al.  Positioning empty containers among multiple ports with leasing and purchasing considerations , 2010, OR Spectr..

[24]  Michel Gendreau,et al.  Progressive hedging‐based metaheuristics for stochastic network design , 2011, Networks.

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

[26]  Teodor Gabriel Crainic,et al.  The Effect of Multi-Scenario Policies on Empty Container Repositioning under Uncertainty and Data Shortage , 2009 .

[27]  Loo Hay Lee,et al.  OPERATION PLANNING FOR EMPTY CONTAINER REPOSITIONING , 2013 .

[28]  Chung-Yee Lee,et al.  Pricing and competition in a transportation market with empty equipment repositioning , 2009 .

[29]  Arne Løkketangen,et al.  Using scenario trees and progressive hedging for stochastic inventory routing problems , 2009, J. Heuristics.

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

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

[32]  C. Feng,et al.  Empty container reposition planning for intra-Asia liner shipping , 2008 .

[33]  Stein W. Wallace,et al.  Approximate scenario solutions in the progressive hedging algorithm , 1991, Ann. Oper. Res..

[34]  Warren B. Powell,et al.  Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems , 2006, INFORMS J. Comput..

[35]  Qingcheng Zeng,et al.  Designing container shipping network under changing demand and freight rates , 2010 .

[36]  D. Song,et al.  Empty container repositioning in liner shipping , 2009 .