A novel continuous berth scheduling model at multiple marine container terminals with tidal considerations

Purpose The paper aims to propose a new mathematical model for allocation and scheduling of vessels at multiple marine container terminals of the same port, considering the access channel depth variations by time of day. Design/methodology/approach This paper proposes a new mathematical model for allocation and scheduling of vessels at multiple marine container terminals of the same port, considering the access channel depth variations by time of day. The access channel serves as a gate for vessels entering or leaving the port. During low-depth tidal periods the vessels with deep drafts have to wait until the depth of the access channel reaches the required depth. Findings A number of numerical experiments are performed using the operational data collected from Port of Bandar Abbas (Iran). Results demonstrate that the suggested methodology is able to improve the existing port operations and significantly decrease delayed vessel departures. Originality/value The contribution of this study to the state of the art is a novel mathematical model for allocation and scheduling of vessels at multiple terminals of the same port, taking into consideration channel depth variations by time of day. To the best of the authors’ knowledge, this is the first continuous berth scheduling linear model that addresses the tidal effects on berth scheduling (both in terms of vessel arrival and departure at/from the berth) at multiple marine container terminals.

[1]  Kay Chen Tan,et al.  Multi-objective and prioritized berth allocation in container ports , 2010, Ann. Oper. Res..

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

[3]  Yuquan Du,et al.  Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth , 2016 .

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

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

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

[7]  Georgios K. D. Saharidis,et al.  The berth allocation problem: Optimizing vessel arrival time , 2009 .

[8]  Michel Bierlaire,et al.  Exact and heuristic methods to solve the berth allocation problem in bulk ports , 2013 .

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

[10]  Kees Jan Roodbergen,et al.  Seaside operations in container terminals: literature overview, trends, and research directions , 2015 .

[11]  Mehmet Fatih Tasgetiren,et al.  A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature , 2011, ICIC.

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

[13]  Abdolreza Sheikholeslami,et al.  The continuous dynamic berth allocation problem at a marine container terminal with tidal constraints in the access channel , 2014 .

[14]  C. Coello TREATING CONSTRAINTS AS OBJECTIVES FOR SINGLE-OBJECTIVE EVOLUTIONARY OPTIMIZATION , 2000 .

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

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

[17]  Maxim A. Dulebenets,et al.  Models and solution algorithms for improving operations in marine transportation , 2015 .

[18]  Christian Bierwirth,et al.  A follow-up survey of berth allocation and quay crane scheduling problems in container terminals , 2015, Eur. J. Oper. Res..

[19]  Li-feng Xi,et al.  A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time , 2010, Eur. J. Oper. Res..

[20]  Belén Melián-Batista,et al.  A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations , 2016, Eur. J. Oper. Res..

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

[22]  Georgios K. D. Saharidis,et al.  Discrete time formulation for the assignment problem applied in cross docking facilities , 2012 .

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

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

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

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

[27]  Alexandre César Muniz de Oliveira,et al.  Model and heuristic for berth allocation in tidal bulk ports with stock level constraints , 2011, Comput. Ind. Eng..

[28]  Kay Chen Tan,et al.  A Multi-Objective Multi-Colony Ant Algorithm for Solving the Berth Allocation Problem , 2008, Advances of Computational Intelligence in Industrial Systems.

[29]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[30]  Yasmine Abouelseoud,et al.  A heuristics-based solution to the continuous berth allocation and crane assignment problem , 2013 .

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

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

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

[34]  Michel Bierlaire,et al.  A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports , 2014, Eur. J. Oper. Res..

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

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

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