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

作者：

Highlights：

• We address Berth Allocation and Quay Crane Assignment Problems in a heuristic way

• We propose a Biased Random-Key Genetic Algorithm for BACAP and its extension BACASP

• Solutions of the Genetic Algorithm are improved by a Local Search

• The complete procedure obtains high-quality solutions for large instances

摘要

•We address Berth Allocation and Quay Crane Assignment Problems in a heuristic way•We propose a Biased Random-Key Genetic Algorithm for BACAP and its extension BACASP•Solutions of the Genetic Algorithm are improved by a Local Search•The complete procedure obtains high-quality solutions for large instances

论文关键词：Container terminal,Berth allocation,Quay crane assignment,Metaheuristic,Genetic algorithm,Local search

论文评审过程：Received 8 March 2017, Revised 14 June 2017, Accepted 17 July 2017, Available online 25 July 2017, Version of Record 27 July 2017.

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