Optimizing berth allocation and storage space in direct transshipment operations at container terminals

Direct transshipment is a new mode in the transshipment of containers, whereby a part of transshipment containers are directly loaded onto mother vessels from feeder vessels, instead of being buffered in the storage yard. To implement it efficiently, several decision issues need to be addressed, one of which is berth allocation and storage space assignment. An integrated model is developed to optimize berth allocation, the storage space assignment, and the direct transshipment plan simultaneously. The objective is to minimize the operational cost of trucks and yard cranes, and the delay cost of vessels. To solve this problem, a heuristic-based algorithm is designed. Numerical experiments are provided to illustrate the validity of the proposed model and algorithms. The results indicate that the direct transshipment mode can decrease operational costs significantly. The model considers benefits for both terminal operators and carriers, promoting the use of direct transshipment as an efficient method to improve transshipment efficiency and thus enhance the competitiveness of container hub ports.

[1]  Akio Imai,et al.  Berth allocation with service priority , 2003 .

[2]  Andrew Lim,et al.  The berth planning problem , 1998, Oper. Res. Lett..

[3]  Andrew Lim,et al.  A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..

[4]  Pierre Hansen,et al.  Variable neighborhood search for minimum cost berth allocation , 2003, Eur. J. Oper. Res..

[5]  Richard Y. K. Fung,et al.  Berth allocation considering fuel consumption and vessel emissions , 2011 .

[6]  Chung-Lun Li,et al.  Berth allocation with time-dependent physical limitations on vessels , 2012, Eur. J. Oper. Res..

[7]  Der-Horng Lee,et al.  Feeder vessel management at container transshipment terminals , 2013 .

[8]  Hao Hu,et al.  Tactical berth and yard template design at container transshipment terminals: A column generation based approach , 2015 .

[9]  Mitsuo Gen,et al.  A berth allocation planning problem with direct transshipment consideration , 2012, J. Intell. Manuf..

[10]  Chung-Cheng Lu,et al.  A network flow model for the dynamic and flexible berth allocation problem , 2015, Comput. Ind. Eng..

[11]  Der-Horng Lee,et al.  Terminal and yard allocation problem for a container transshipment hub with multiple terminals , 2012 .

[12]  K. K. Lai,et al.  A STUDY OF CONTAINER BERTH ALLOCATION. , 1992 .

[13]  Akio Imai,et al.  Efficient planning of berth allocation for container terminals in Asia , 1997 .

[14]  Kap Hwan Kim,et al.  Berth scheduling by simulated annealing , 2003 .

[15]  Nathan Huynh,et al.  Storage space allocation at marine container terminals using ant-based control , 2013, Expert Syst. Appl..

[16]  Lu Chen,et al.  The storage location assignment problem for outbound containers in a maritime terminal , 2012 .

[17]  Akio Imai,et al.  BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH , 2005 .

[18]  Akio Imai,et al.  Container storage and transshipment marine terminals , 2009 .

[19]  Nima Safaei,et al.  An integrated storage space and berth allocation problem in a container terminal , 2010, Int. J. Math. Oper. Res..

[20]  Jan Tijmen Udding,et al.  Simultaneous berth allocation and yard planning at tactical level , 2013, OR Spectr..

[21]  Akio Imai,et al.  Berth allocation planning in the public berth system by genetic algorithms , 2001, Eur. J. Oper. Res..

[22]  Loo Hay Lee,et al.  An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs , 2011, Transp. Sci..

[23]  Sean Bolt Floating transfer stations : a logistics option for exporting coal from the West Coast , 2006 .

[24]  Richard J. Linn,et al.  Storage space allocation in container terminals , 2003 .