In the container relocation problem (CRP) n items are given that belong to G different itemgroups (g = 1,…,G). The items are piled up in up to S stacks with a maximum stack height H.A move can either shift one item from the top of a stack to the top of another one (relocation)or pick an item...

In the container pre-marshalling problem (CPMP) n items are given that belong to G different item groups (g=1,…,G) and that are piled up in up to S stacks with a maximum stack height H. A move can shift one item from one stack to another one. A sequence of moves of minimum length has to be...