New hybrid genetic algorithms to solve dynamic berth allocation problem

作者：

Highlights：

• Novel metaheuristics to address a berth allocation problem.

• A new dynamic mathematical model comprising special features from real port systems.

• Metaheuristics combinating genetic algorithms and a dynamic programming method.

• Local search exploring a confinement procedure to seek promising solution regions.

• Computational results show the metaheuristics efficiency to solve large-scale cases.

摘要

•Novel metaheuristics to address a berth allocation problem.•A new dynamic mathematical model comprising special features from real port systems.•Metaheuristics combinating genetic algorithms and a dynamic programming method.•Local search exploring a confinement procedure to seek promising solution regions.•Computational results show the metaheuristics efficiency to solve large-scale cases.

论文关键词：Dynamic berth allocation problem,Genetic algorithm,Dynamic programming,Metaheuristics

论文评审过程：Received 15 August 2020, Revised 1 October 2020, Accepted 29 October 2020, Available online 2 November 2020, Version of Record 10 February 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.114198