Portal de Periódicos da CAPES

Minimizing crane times in pre-marshalling problems

2020; Elsevier BV; Volume: 137; Linguagem: Inglês

10.1016/j.tre.2020.101917

1878-5794

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

Optimization and Packing Problems

The pre-marshalling problem has been extensively studied in recent years with the aim of minimizing the number of movements needed to rearrange a bay of containers. Time is a more realistic objective for measuring process efficiency, and we show that it does not correlate with the number of movements. As a result, we study the problem of minimizing crane times and develop two exact approaches to solve it: an integer linear model, and a branch and bound algorithm, with new upper and lower bounds, dominance criteria, and a heuristic procedure, to provide optimal solutions for problems of practical size.