POPMUSIC as a matheuristic for the berth allocation problem

The Berth Allocation Problem aims at assigning and scheduling incoming vessels to berthing positions along the quay of a container terminal. This problem is a well-known optimization problem within maritime shipping. In order to address it, we propose two POPMUSIC (Partial Optimization Metaheuristic Under Special Intensification Conditions) approaches that incorporate an existing mathematical programming formulation. POPMUSIC is an efficient metaheuristic that may serve as blueprint for matheuristics approaches once hybridized with mathematical programming. In this regard, the use of exact methods for solving the sub-problems defined in the POPMUSIC template highlight an interoperation between metaheuristics and mathematical programming techniques, which provide a new type of approach for this problem. The computational experiments reveal excellent results.

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

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

[3]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[4]  Ching-Jung Ting,et al.  Particle swarm optimization algorithm for the berth allocation problem , 2014, Expert Syst. Appl..

[5]  Stefan Voß,et al.  The corridor method: a dynamic programming inspired metaheuristic , 2006 .

[6]  Stefan Voß,et al.  Container terminal operation and operations research — a classification and literature review , 2004 .

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

[8]  Stefan Voß,et al.  Modeling Container Terminal Scheduling Systems as Hybrid Flow Shops with Blocking Based on Attributes , 2009 .

[9]  Nils Boysen,et al.  Berth allocation in container terminals that service feeder ships and deep-sea vessels , 2016, J. Oper. Res. Soc..

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

[11]  Vittorio Maniezzo,et al.  Matheuristics: Hybridizing Metaheuristics and Mathematical Programming , 2009 .

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

[13]  Belén Melián-Batista,et al.  Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem , 2012, Eng. Appl. Artif. Intell..

[14]  Shanlin Yang,et al.  Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain , 2014 .

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

[16]  Stefan Voß,et al.  Liegeplatzdisposition auf einem Container Terminal — Ansätze zur Entwicklung eines entscheidungsunterstützenden Systems , 1994 .

[17]  Éric D. Taillard,et al.  POPMUSIC for the world location-routing problem , 2013, EURO J. Transp. Logist..

[18]  Valentín.  Chapter 4. , 1998, Annals of the ICRP.

[19]  D. Preßmar,et al.  Operations research proceedings , 1990 .

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

[21]  T. Notteboom.  The Time Factor in Liner Shipping Services , 2006 .

[22]  Eduardo Lalla-Ruiz,et al.  Towards a Matheuristic Approach for the Berth Allocation Problem , 2014, LION.

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

[24]  Luiz Antonio Nogueira Lorena,et al.  Clustering Search for the Berth Allocation Problem , 2012, Expert Syst. Appl..

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

[26]  Jorge Puente,et al.  A genetic algorithm for robust berth allocation and quay crane assignment , 2014, Progress in Artificial Intelligence.

[27]  Kjetil Fagerholt,et al.  Chapter 4 Maritime Transportation , 2007, Transportation.

[28]  Éric D. Taillard,et al.  Popmusic — Partial Optimization Metaheuristic under Special Intensification Conditions , 2002 .

[29]  Belén Melián-Batista,et al.  Biased random key genetic algorithm for the Tactical Berth Allocation Problem , 2014, Appl. Soft Comput..

[30]  Greet Van den Berghe,et al.  A Late Acceptance Algorithm for the Lock Scheduling Problem , 2009 .

[31]  de OliveiraRudinei Martins,et al.  Clustering Search for the Berth Allocation Problem , 2012 .

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

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