A branch-and-cut algorithm for the restricted Block Relocation Problem

Tiziano Bacci, Sara Mattia and Paolo Ventura

European Journal of Operational Research, 2020, vol. 287, issue 2, 452-459

Abstract: We consider the Block Relocation Problem, that has a crucial role in the logistics of containers. It consists of minimizing the number of container relocations within a container bay/yard. Since the number of containers shipped worldwide grew dramatically in the last years, the problem has been widely investigated. Here we propose an exact algorithm for the restricted version of the Block Relocation Problem, based on a new integer linear programming formulation. We compare such new approach with the state-of-art exact methods. The computational results prove its effectiveness and show that it outperforms all the previously proposed procedures, in almost all the considered instances.

Keywords: Block Relocation problem; Integer Programming formulation; Branch-and-cut (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221720304756
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:287:y:2020:i:2:p:452-459

DOI: 10.1016/j.ejor.2020.05.029

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().