Minimizing crane times in pre-marshalling problems. (May 2020)

• Record Type: Journal Article
• Authors: Parreño-Torres, Consuelo; Alvarez-Valdes, Ramon; Ruiz, Rubén; Tierney, Kevin
• Is Part Of: Transportation research. Volume 137(2020)
• Publication Date: 2020-05
• Subjects: Logistics -- Container pre-marshalling -- Crane time -- Maritime transport -- Terminal operations; Logistics -- Periodicals; Transportation -- Periodicals; 388.011
• DOI: 10.1016/j.tre.2020.101917
• Languages: English
• ISSNs: 1366-5545

Abstract

Highlights: A crane time minimization objective to solve the pre-marshalling problem is proposed. We present novel upper and lower bounds and dominance criteria to solve the problem. Two exact approaches are proposed: an IP model and a branch and bound algorithm. We conduct an extensive computational study to show the performance of our proposals. Abstract: 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.