Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results

Most of the operational problems in container terminals are strongly interconnected. In this paper, we study the integrated Berth Allocation and Quay Crane Assignment Problem in seaport container terminals. We will extend the current state-of-the-art by proposing novel set partitioning models. To improve the performance of the set partitioning formulations, a number of variable reduction techniques are proposed. Furthermore, we analyze the effects of different discretization schemes and the impact of using a time-variant/invariant quay crane allocation policy. Computational experiments show that the proposed models significantly improve the benchmark solutions of the current state-of-art optimal approaches.

[1]  Daofang Chang,et al.  Integrating Berth Allocation and Quay Crane Assignments , 2010 .

[2]  Z. Caner Taskin,et al.  Optimal berth allocation and time-invariant quay crane assignment in container terminals , 2014, Eur. J. Oper. Res..

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

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

[5]  Xiaojun Wang,et al.  An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal , 2012, Comput. Ind. Eng..

[6]  Jesper Larsen,et al.  Models for the discrete berth allocation problem: A computational comparison , 2011 .

[7]  R. Asariotis,et al.  Review of Maritime Transport, 2014 , 2010 .

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

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

[10]  Christian Bierwirth,et al.  A Framework for Integrated Berth Allocation and Crane Operations Planning in Seaport Container Terminals , 2013, Transp. Sci..

[11]  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..

[12]  Der-Horng Lee,et al.  A combinatorial benders’ cuts algorithm for the quayside operation problem at container terminals , 2012 .

[13]  D. M. Deighton,et al.  Computers in Operations Research , 1977, Aust. Comput. J..

[14]  Birger Raa,et al.  An enriched model for the integrated berth allocation and quay crane assignment problem , 2011, Expert Syst. Appl..

[15]  Birger Raa,et al.  The Berth Allocation and Quay Crane Assignment Problem Using a CP Approach , 2013, CP.

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

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

[18]  Lei Wang,et al.  Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures , 2006 .

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

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

[21]  Michel Bierlaire,et al.  An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment , 2013, Transp. Sci..

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

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

[24]  Emma Frejinger,et al.  A Column Generation Framework for Berth Scheduling at Port Terminals , 2015 .

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

[26]  Frank Meisel,et al.  Seaside Operations Planning in Container Terminals , 2009 .

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

[28]  T. C. Edwin Cheng,et al.  Berth and quay crane allocation: a moldable task scheduling model , 2011, J. Oper. Res. Soc..

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

[30]  Gerald L. Thompson,et al.  The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems , 1994, Comput. Oper. Res..