Optimization Online


New solution methods for the block relocation problem

Fabien Tricoire(fabien.tricoire***at***univie.ac.at)
Judith Fechter(judith.fechter***at***fh-hagenberg.at)
Andreas Beham(andreas.beham***at***fh-hagenberg.at)

Abstract: This technical report presents new solution methods for the block relocation problem (BRP). Although most 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 branch-and-bound algorithm that outperforms the best existing exact method and provides new optimal solutions. The branch-and-bound algorithm is adapted to tackle the restricted BRP as well, again outperforming existing methods for that problem.

Keywords: block relocation problem, heuristics, branch-and-bound

Category 1: Applications -- OR and Management Sciences


Download: [PDF]

Entry Submitted: 03/10/2016
Entry Accepted: 03/10/2016
Entry Last Modified: 03/10/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society