Talks and Poster Presentations (with Proceedings-Entry):
A. Tus, A. Rendl, G. Raidl:
"Metaheuristics for the Two-Dimensional Container-Pre-Marshalling-Problem";
Talk: LION 9,
- 2015-01-15; in: "Learning and Intelligent Optimization",
C. Dhaenens, L. Jourdan, M. Marmion (ed.);
We introduce a new problem arising in small and medium-sized container terminals: the Two-Dimensional Pre-Marshalling Problem (2D-PMP). It is an extension of the well-studied Pre-Marshalling Problem (PMP) that is crucial in container storage. The 2D-PMP is particularly challenging due to its complex side constraints that are challenging to express and difficult to consider with standard techniques for the PMP. We present three different heuristic approaches for the 2D-PMP. First, we adapt an existing construction heuristic that was designed for the classical PMP. We then apply this heuristic within two metaheuristics: a Pilot method and a Max-Min Ant System that incorporates a special pheromone model. In our empirical evaluation we observe that the Max-Min Ant System outperforms the other approaches by yielding better solutions in almost all cases.
metaheuristics, two dimensional container pre marshalling problem
Created from the Publication Database of the Vienna University of Technology.