An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules

Abstract

The container relocation problem, also known as the block(s) relocation problem, is one of the most studied optimization problems in container terminals. The problem aims at minimizing the total number of relocations for retrieving containers from a storage yard according to a specific order. The purpose of this study is to develop an efficient iterative deepening branch-and-bound algorithm for exactly solving one of the most practical variants of the problem, namely the unrestricted container relocation problem with duplicate priorities, which has received less attention in the literature. To improve the search efficiency of the proposed algorithm, we design two new lower bounds that can be computed quickly to incorporate them into the branch-and-bound algorithm. We also present a set of mutually consistent dominance rules to reduce the search space while avoiding over-pruning. The performance of the proposed algorithm is evaluated by extensive computational experiments on three commonly used benchmark datasets. The results show that the proposed algorithm outperforms the state-of-the-art exact algorithm for the unrestricted container relocation problem with distinct priorities, although our algorithm is applicable to a more general variant of the problem. Moreover, it can still provide competitive results for small- and medium-sized instances under a strict time limit of one second in comparison to existing metaheuristic approaches.