New insights on the block relocation problem

作者：Tricoire Fabien^*; Scagnetti Judith; Beham Andreas

来源：Computers & Operations Research, 2018, 89: 127-139.

DOI：10.1016/j.cor.2017.08.010

• Block relocation problem
• Heuristics
• Branch-and-bound

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.

• 出版日期2018-1