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

Hottung A, Tierney K (2016)
Computers & Operations Research 75: 83-102.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Hottung, André; Tierney, KevinUniBi
Abstract / Bemerkung
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.
Erscheinungsjahr
2016
Zeitschriftentitel
Computers & Operations Research
Band
75
Seite(n)
83-102
ISSN
0305-0548
Page URI
https://pub.uni-bielefeld.de/record/2958237

Zitieren

Hottung A, Tierney K. A biased random-key genetic algorithm for the container pre-marshalling problem. Computers & Operations Research. 2016;75:83-102.
Hottung, A., & Tierney, K. (2016). A biased random-key genetic algorithm for the container pre-marshalling problem. Computers & Operations Research, 75, 83-102. https://doi.org/10.1016/j.cor.2016.05.011
Hottung, A., and Tierney, K. (2016). A biased random-key genetic algorithm for the container pre-marshalling problem. Computers & Operations Research 75, 83-102.
Hottung, A., & Tierney, K., 2016. A biased random-key genetic algorithm for the container pre-marshalling problem. Computers & Operations Research, 75, p 83-102.
A. Hottung and K. Tierney, “A biased random-key genetic algorithm for the container pre-marshalling problem”, Computers & Operations Research, vol. 75, 2016, pp. 83-102.
Hottung, A., Tierney, K.: A biased random-key genetic algorithm for the container pre-marshalling problem. Computers & Operations Research. 75, 83-102 (2016).
Hottung, André, and Tierney, Kevin. “A biased random-key genetic algorithm for the container pre-marshalling problem”. Computers & Operations Research 75 (2016): 83-102.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®

Suchen in

Google Scholar