A multi-heuristic approach for solving the pre-marshalling problem

Raka Jovanovic, Milan Tuba, Stefan Voß

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

Minimizing the number of reshuffling operations at maritime container terminals incorporates the pre-marshalling problem (PMP) as an important problem. Based on an analysis of existing solution approaches we develop new heuristics utilizing specific properties of problem instances of the PMP. We show that the heuristic performance is highly dependent on these properties. We introduce a new method that exploits a greedy heuristic of four stages, where for each of these stages several different heuristics may be applied. Instead of using randomization to improve the performance of the heuristic, we repetitively generate a number of solutions by using a combination of different heuristics for each stage. In doing so, only a small number of solutions is generated for which we intend that they do not have undesirable properties, contrary to the case when simple randomization is used. Our experiments show that such a deterministic algorithm significantly outperforms the original nondeterministic method. The improvement is twofold, both in the quality of found solutions, and in the computational effort.

Original languageEnglish
JournalCentral European Journal of Operations Research
DOIs
Publication statusAccepted/In press - 26 Jul 2015

Fingerprint

Heuristics
Randomization
Container terminal
Experiment

Keywords

  • Container terminal
  • Heuristics
  • Logistics
  • Pre-marshalling

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

A multi-heuristic approach for solving the pre-marshalling problem. / Jovanovic, Raka; Tuba, Milan; Voß, Stefan.

In: Central European Journal of Operations Research, 26.07.2015.

Research output: Contribution to journalArticle

@article{99f38a1ea095486e9442404690383b69,
title = "A multi-heuristic approach for solving the pre-marshalling problem",
abstract = "Minimizing the number of reshuffling operations at maritime container terminals incorporates the pre-marshalling problem (PMP) as an important problem. Based on an analysis of existing solution approaches we develop new heuristics utilizing specific properties of problem instances of the PMP. We show that the heuristic performance is highly dependent on these properties. We introduce a new method that exploits a greedy heuristic of four stages, where for each of these stages several different heuristics may be applied. Instead of using randomization to improve the performance of the heuristic, we repetitively generate a number of solutions by using a combination of different heuristics for each stage. In doing so, only a small number of solutions is generated for which we intend that they do not have undesirable properties, contrary to the case when simple randomization is used. Our experiments show that such a deterministic algorithm significantly outperforms the original nondeterministic method. The improvement is twofold, both in the quality of found solutions, and in the computational effort.",
keywords = "Container terminal, Heuristics, Logistics, Pre-marshalling",
author = "Raka Jovanovic and Milan Tuba and Stefan Vo{\ss}",
year = "2015",
month = "7",
day = "26",
doi = "10.1007/s10100-015-0410-y",
language = "English",
journal = "Central European Journal of Operations Research",
issn = "1435-246X",
publisher = "Physica-Verlag",

}

TY - JOUR

T1 - A multi-heuristic approach for solving the pre-marshalling problem

AU - Jovanovic, Raka

AU - Tuba, Milan

AU - Voß, Stefan

PY - 2015/7/26

Y1 - 2015/7/26

N2 - Minimizing the number of reshuffling operations at maritime container terminals incorporates the pre-marshalling problem (PMP) as an important problem. Based on an analysis of existing solution approaches we develop new heuristics utilizing specific properties of problem instances of the PMP. We show that the heuristic performance is highly dependent on these properties. We introduce a new method that exploits a greedy heuristic of four stages, where for each of these stages several different heuristics may be applied. Instead of using randomization to improve the performance of the heuristic, we repetitively generate a number of solutions by using a combination of different heuristics for each stage. In doing so, only a small number of solutions is generated for which we intend that they do not have undesirable properties, contrary to the case when simple randomization is used. Our experiments show that such a deterministic algorithm significantly outperforms the original nondeterministic method. The improvement is twofold, both in the quality of found solutions, and in the computational effort.

AB - Minimizing the number of reshuffling operations at maritime container terminals incorporates the pre-marshalling problem (PMP) as an important problem. Based on an analysis of existing solution approaches we develop new heuristics utilizing specific properties of problem instances of the PMP. We show that the heuristic performance is highly dependent on these properties. We introduce a new method that exploits a greedy heuristic of four stages, where for each of these stages several different heuristics may be applied. Instead of using randomization to improve the performance of the heuristic, we repetitively generate a number of solutions by using a combination of different heuristics for each stage. In doing so, only a small number of solutions is generated for which we intend that they do not have undesirable properties, contrary to the case when simple randomization is used. Our experiments show that such a deterministic algorithm significantly outperforms the original nondeterministic method. The improvement is twofold, both in the quality of found solutions, and in the computational effort.

KW - Container terminal

KW - Heuristics

KW - Logistics

KW - Pre-marshalling

UR - http://www.scopus.com/inward/record.url?scp=84937894105&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937894105&partnerID=8YFLogxK

U2 - 10.1007/s10100-015-0410-y

DO - 10.1007/s10100-015-0410-y

M3 - Article

JO - Central European Journal of Operations Research

JF - Central European Journal of Operations Research

SN - 1435-246X

ER -