Activity: Talk or presentation / Lecture › Presentation at a scientific conference / workshop
Description
The Pre-Marshaling Problem (PMP) arises in container terminals where the goal is to find an operation plan with as few container movements as possible for pre-ordering containers according to specified priorities such that containers with higher priorities are not blocked by containers with lower ones. We propose a new dynamic programming approach for solving the PMP. Computational experiments emphasize that this is the first exact approach being capable of solving (almost) all benchmark instances of real-world size available in literature to proven optimality within only a few milliseconds.