Portal de Periódicos da CAPES

A branch and bound approach for large pre-marshalling problems

2019; Elsevier BV; Volume: 278; Issue: 1 Linguagem: Inglês

10.1016/j.ejor.2019.04.005

1872-6860

Shunji Tanaka, Kevin Tierney, Consuelo Parreño-Torres, Ramón Álvarez-Valdés, Rubén Ruíz,

Optimization and Packing Problems

The container pre-marshalling problem involves the sorting of containers in stacks so that there are no blocking containers and retrieval is carried out without additional movements. This sorting process should be carried out in as few container moves as possible. Despite recent advancements in solving real world sized problems to optimality, several classes of pre-marshalling problems remain difficult for exact approaches. We propose a branch and bound algorithm with new components for solving such difficult instances. We strengthen existing lower bounds and introduce two new lower bounds that use a relaxation of the pre-marshalling problem to provide tight bounds in specific situations. We introduce generalized dominance rules that help reduce the search space, and a memoization heuristic that finds feasible solutions quickly. We evaluate our approach on standard benchmarks of pre-marshalling instances, as well as on a new dataset to avoid overfitting to the available data. Overall, our approach optimally solves many more instances than previous work, and finds feasible solutions on nearly every problem it encounters in limited CPU times.