The task of finding the minimum sequence of container movements that transforms an initial bay into a bay that does not require redundant relocations during an actual loading operation is referred to as the container pre-marshalling problem (CPMP). A majority of existing approaches focus only on improving computational efficiency through heuristics, which may not guarantee the optimality of obtained solutions. This paper discusses an efficient search method for obtaining optimal solutions of the CPMP. Unlike most existing approaches, which introduce heuristics for efficiency, this paper pursues an optimization method that preserves optimality without heuristics. Further, through experimental results, we demonstrate how the proposed approach surpasses heuristic approaches in both optimality and efficiency in large-scale problem instances.

1.
A.
Bortfeldt
and
F.
Forster
, “
A tree search procedure for the container pre-marshalling problem
”,
European Journal of Operational Research
217
, pp.
531
540
(March
2012
).
2.
C.
Expósito-Izquierdo
,
B.
Melián-Batista
, and
M.
Moreno-Vega
, “
Pre-Marshalling Problem: Heuristic solution method and instances generator
”,
Expert Systems with Applications
39
, pp.
8337
8349
(
2012
).
3.
M.
Caserta
and
S.
Voß
, “
A Corridor Method-Based Algorithm for the Pre-marshalling Problem
”, in
Applications of Evolutionary Computing, Lecture Notes in Computer Science
, Vol.
5484
(
Springer Berlin Heidelberg
,
2009
), pp.
788
797
.
4.
W.
Zhu
,
H.
Qin
,
A.
Lim
, and
H.
Zhang
, “
Iterative Deepening A* Algorithms for the Container Relocation Problem
”,
Automation Science and Engineering, IEEE Transactions on
9
,
710
722
(
2012
).
5.
K.
Kim
and
H.
Hong
, “
A heuristic rule for relocating blocks
”,
Computers & Operations Research
,
33
, pp.
940
954
(
2006
).
6.
S.
Voß
, “
Extended Mis-overlay Calculation for Pre-marshalling Containers
”,
Computational Logistics
, Volume
7555
of the series Lecture Notes in Computer Science pp
86
91
(
2012
).
This content is only available via PDF.