An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs

This paper studies two tactical level decision problems arising in transshipment hubs: berth template planning that is concerned with allocating berths and quay cranes to arriving vessels, and yard template planning that is concerned with assigning yard storage locations to vessels. These two tactical level decisions interact with each other. A mixed-integer programming model is proposed to integrate the berth template and the yard template planning with the aim to minimize the service cost that is incurred by the deviation from vessels' expected turnaround time intervals, and the operation cost that is related to the route length of transshipment container flows in yard. Moreover, a heuristic algorithm is developed for solving the problem in large-scale realistic environments. Numerical experiments are conducted to prove the necessity of the proposed model and also validate the efficiency of the proposed heuristic algorithm. For a set of real-world like instances, the heuristic algorithm can obtain good berth and yard templates within a reasonable time.

[1]  Christian Bierwirth,et al.  A survey of berth allocation and quay crane scheduling problems in container terminals , 2010, Eur. J. Oper. Res..

[2]  Loo Hay Lee,et al.  An optimization model for storage yard management in transshipment hubs , 2006, OR Spectr..

[3]  Yongpei Guan,et al.  The berth allocation problem: models and solution methods , 2004 .

[4]  Akio Imai,et al.  Berth allocation at indented berths for mega-containerships , 2007, Eur. J. Oper. Res..

[5]  Ping Chen,et al.  Port yard storage optimization , 2004, IEEE Transactions on Automation Science and Engineering.

[6]  Youfang Huang,et al.  A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning , 2009, Comput. Ind. Eng..

[7]  Roberto Musmanno,et al.  A queuing network model for the management of berth crane operations , 2008, Comput. Oper. Res..

[8]  Mihalis M. Golias,et al.  Berth scheduling by customer service differentiation: A multi-objective approach , 2009 .

[9]  Kap Hwan Kim,et al.  Segregating space allocation models for container inventories in port container terminals , 1999 .

[10]  Pasquale Legato,et al.  Berth planning and resources optimisation at a container terminal via discrete event simulation , 2001, Eur. J. Oper. Res..

[11]  Kap Hwan Kim,et al.  THE OPTIMAL SIZING OF THE STORAGE SPACE AND HANDLING FACILITIES FOR IMPORT CONTAINERS , 2002 .

[12]  Chung-Lun Li,et al.  A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis , 2002, Oper. Res. Lett..

[13]  Akio Imai,et al.  The simultaneous berth and quay crane allocation problem , 2008 .

[14]  Maria Flavia Monaco,et al.  The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach , 2007, Transp. Sci..

[15]  Leyuan Shi,et al.  The allocation of berths and quay cranes by using a sub-gradient optimization technique , 2010, Comput. Ind. Eng..

[16]  Loo Hay Lee,et al.  A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub , 2008, OR Spectr..

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

[18]  Andrew Lim,et al.  A critical-shaking neighborhood search for the yard allocation problem , 2006, Eur. J. Oper. Res..

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

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

[21]  Nima Safaei,et al.  A genetic algorithm to solve the storage space allocation problem in a container terminal , 2009, Comput. Ind. Eng..

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

[23]  Kap Hwan Kim,et al.  Berth scheduling for container terminals by using a sub-gradient optimization technique , 2002, J. Oper. Res. Soc..

[24]  Iris F. A. Vis,et al.  Transshipment of containers at a container terminal: An overview , 2003, Eur. J. Oper. Res..

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

[26]  Gilbert Laporte,et al.  Models and Tabu Search Heuristics for the Berth-Allocation Problem , 2005, Transp. Sci..

[27]  Akio Imai,et al.  Berthing ships at a multi-user container terminal with a limited quay capacity , 2008 .

[28]  Stefan Voß,et al.  Operations research at container terminals: a literature update , 2007, OR Spectr..

[29]  Akio Imai,et al.  The Berth Allocation Problem with Service Time and Delay Time Objectives , 2007 .

[30]  Kap Hwan Kim,et al.  Deriving decision rules to locate export containers in container yards , 2000, Eur. J. Oper. Res..

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

[32]  Kap Hwan Kim,et al.  A scheduling method for Berth and Quay cranes , 2003 .

[33]  Chung-Piaw Teo,et al.  Berth management in container terminal: the template design problem , 2006, OR Spectr..

[34]  Christian Bierwirth,et al.  Heuristics for the integration of crane productivity in the berth allocation problem , 2009 .

[35]  Yusin Lee,et al.  An optimization heuristic for the berth scheduling problem , 2009, Eur. J. Oper. Res..

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

[37]  Matteo Salani,et al.  Modeling and Solving the Tactical Berth Allocation Problem , 2010 .

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

[39]  Erhan Kozan,et al.  Mathematical modelling of container transfers and storage locations at seaport terminals , 2006, OR Spectr..

[40]  Kap Hwan Kim,et al.  A note on a dynamic space-allocation method for outbound containers , 2003, Eur. J. Oper. Res..

[41]  西村 悦子,et al.  Berth Allocation Planning in the Public Berth System by Genetic Algorithms , 2000 .

[42]  Erhan Kozan,et al.  An approach to determine storage locations of containers at seaport terminals , 2001, Comput. Oper. Res..

[43]  Akio Imai,et al.  The Dynamic Berth Allocation Problem for a Container Port , 2001 .

[44]  Branislav Dragović,et al.  Simulation Modelling of Ship-Berth Link With Priority Service , 2005 .

[45]  Gilbert Laporte,et al.  The service allocation problem at the Gioia Tauro Maritime Terminal , 2007, Eur. J. Oper. Res..

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