Quotation Tricoire, Fabien, Scagnetti, Judith, Beham, Andreas. 2018. New insights on the block relocation problem. Computers and Operations Research. 89 127-139.




This article presents new methods for the block relocation problem (BRP). Although much of the existing work focuses on the restricted BRP, we tackle the unrestricted BRP, which yields more opportunities for optimisation. Our contributions include fast heuristics able to tackle very large instances within seconds, fast metaheuristics that provide very competitive performance on benchmark data sets, as well as a new lower bound that generalises existing ones. We embed it in a branch-and-bound algorithm, then assess the influence of various factors on the efficiency of branch-and-bound algorithms for the BRP.


Press 'enter' for creating the tag

Publication's profile

Status of publication Published
Affiliation External
Type of publication Journal article
Journal Computers and Operations Research
Citation Index SCI
WU Journalrating 2009 A
WU-Journal-Rating new FIN-A, INF-A, STRAT-B, WH-B
Language English
Title New insights on the block relocation problem
Volume 89
Year 2018
Page from 127
Page to 139
Reviewed? Y
URL https://www.sciencedirect.com/science/article/pii/S0305054817302174
DOI https://doi.org/10.1016/j.cor.2017.08.010
Open Access N


Tricoire, Fabien (Details)
Beham, Andreas (FH Oberösterreich, Austria)
Scagnetti, Judith (FH Oberösterreich, Austria)
Google Scholar: Search