A biased random-key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem

We address Berth Allocation and Quay Crane Assignment Problems in a heuristic wayWe propose a Biased Random-Key Genetic Algorithm for BACAP and its extension BACASPSolutions of the Genetic Algorithm are improved by a Local SearchThe complete procedure obtains high-quality solutions for large instances Maritime transportation plays a crucial role in the international economy. Port container terminals around the world compete to attract more traffic and are forced to offer better quality of service. This entails reducing operating costs and vessel service times. In doing so, one of the most important problems they face is the Berth Allocation and quay Crane Assignment Problem (BACAP). This problem consists of assigning a number of cranes and a berthing time and position to each calling vessel, aiming to minimize the total cost. An extension of this problem, known as the BACAP Specific (BACASP), also involves determining which specific cranes are to serve each vessel. In this paper, we address the variant of both BACAP and BACASP consisting of a continuous quay, with dynamic arrivals and time-invariant crane-to-vessel assignments. We propose a metaheuristic approach based on a Biased Random-key Genetic Algorithm with memetic characteristics and several Local Search procedures. The performance of this method, in terms of both time and quality of the solutions obtained, was tested in several computational experiments. The results show that our approach is able to find optimal solutions for some instances of up to 40 vessels and good solutions for instances of up to 100 vessels.

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

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

[3]  Miguel A. Salido,et al.  Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem , 2014 .

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

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

[6]  Z. Caner Taskin,et al.  Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals , 2016, Eur. J. Oper. Res..

[7]  Yong Wu,et al.  Planning and Scheduling for Maritime Container Yards: Supporting and Facilitating the Global Supply Network , 2015 .

[8]  Marshall Conley,et al.  Canadian shipping policies and the United Nations Conference on Trade and Development: an analysis of UNCTAD V , 1982 .

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

[10]  Mauricio G. C. Resende,et al.  A biased random key genetic algorithm for 2D and 3D bin packing problems , 2013 .

[11]  Mauricio G. C. Resende,et al.  A parallel multi-population biased random-key genetic algorithm for a container loading problem , 2012, Comput. Oper. Res..

[12]  Scott E. Maxwell,et al.  Designing Experiments and Analyzing Data: A Model Comparison Perspective , 1990 .

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

[14]  Mehmet Fatih Tasgetiren,et al.  A Discrete Differential Evolution Algorithm for the Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[15]  Jungbok Jo,et al.  A new continuous berth allocation and quay crane assignment model in container terminal , 2015, Comput. Ind. Eng..

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

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

[18]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..

[19]  Ramón Alvarez-Valdés,et al.  The continuous Berth Allocation Problem in a container terminal with multiple quays , 2015, Expert Syst. Appl..

[20]  Mario Rodríguez-Molins,et al.  A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds , 2013, Applied Intelligence.

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

[22]  Congcong Wu,et al.  An integrated optimization method to solve the berth-QC allocation problem , 2012, 2012 8th International Conference on Natural Computation.

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

[24]  Zhi-Hua Hu,et al.  Berth and quay-crane allocation problem considering fuel consumption and emissions from vessels , 2014, Comput. Ind. Eng..

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

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

[27]  Bernhard Sendhoff,et al.  Lamarckian memetic algorithms: local optimum and connectivity structure analysis , 2009, Memetic Comput..

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

[29]  Zhi-Hua Hu,et al.  Heuristics for solving continuous berth allocation problem considering periodic balancing utilization of cranes , 2015, Comput. Ind. Eng..

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

[31]  E. Hopper,et al.  An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..

[32]  Allan Larsen,et al.  Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results , 2015 .

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

[34]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[35]  Junliang He,et al.  Berth allocation and quay crane assignment in a container terminal for the trade-off between time-saving and energy-saving , 2016, Adv. Eng. Informatics.

[36]  Zhi-Hua Hu,et al.  Berth Allocation Problem with Quay Crane Assignment for Container Terminals Based on Rolling-Horizon Strategy , 2014 .

[37]  Amr B. Eltawil,et al.  Functional integration approach for the berth allocation, quay crane assignment and specific quay crane assignment problems , 2016, Comput. Ind. Eng..

[38]  Mehmet Fatih Tasgetiren,et al.  A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[39]  Edward Tsang,et al.  Novel constraints satisfaction models for optimization problems in container terminals , 2013 .

[40]  Jie Ren,et al.  A robust optimization approach to the integrated berth allocation and quay crane assignment problem , 2016 .

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

[42]  Manuel Iori,et al.  Metaheuristic Algorithms for the Strip Packing Problem , 2003 .