A tree search procedure for the container relocation problem

Publication year: 2012
Source: Computers & Operations Research, Volume 39, Issue 2, February 2012, Pages 299-309

Florian, Forster , Andreas, Bortfeldt

In the container relocation problem (CRP) n items are given that belong to G different item groups (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 from the top of a stack and entirely remove it (remove). A move of the latter type is only feasible if the group index of the item is minimum compared to all remaining items in all stacks. A move sequence of minimum…