Column Generation for the Container Relocation Problem

Container terminals offer transfer facilities to move containers from vessels to trucks, trains and barges and vice versa. Within the terminal the container yard serves as a temporary buffer where incoming containers are piled up in stacks. Only the topmost container of each stack can be accessed. If another container has to be retrieved, containers stored above it must be relocated first. Containers need to be transported to a ship or to trucks in a predefined sequence as fast as possible. Generally, this sequence does not match the stacking order within the yard. Therefore, a sequence of retrieval and relocation movements has to be determined that retrieves containers from the bay in the prescribed order with a minimum number of relocations. This problem is known as the container relocation problem. We apply an exact and a heuristic column generation approach to this problem. First results are very promising since both approaches provide very tight lower bounds on the minimum number of relocations