A biased random-key genetic algorithm for the container pre-marshalling problem

作者：Hottung Andre; Tierney Kevin^*

来源：Computers & Operations Research, 2016, 75: 83-102.

DOI：10.1016/j.cor.2016.05.011

• Container pre-marshalling
• Maritime applications
• Biased random-key genetic algorithm

The container pre-marshalling problem (CPMP) is performed at container terminals around the world to re-order containers so that they can be more efficiently transferred through the terminal. We introduce a novel decoder for a biased random-key genetic algorithm (BRKGA) that solves the CPMP. The decoder consists of a construction algorithm that learns how to best apply single and compound containers moves to quickly sort a bay of containers. Our approach finds better solutions than the state-of-the-art method on many instances of the standard pre-marshalling benchmarks in less computational time. Furthermore, we perform a computational analysis of different components of the BRKGA decoder to determine what types of heuristics work best for pre-marshalling problems, as well as conduct a feature space analysis of different pre-marshalling approaches.

• 出版日期2016-11