Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 103, Issue -, Pages 252-264Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2018.11.008
Keywords
Block relocation; Container relocation; Beam search; Lower bound; Heuristics; Realistic instances
Categories
Funding
- Ministry of Instruction University and Research (MIUR) [2015XAPRKF, 2015B5F27W, 20153TXRX9, FILAS-CR-2011-1315]
Ask authors/readers for more resources
In this paper we deal with the restricted Block Relocation Problem. We present a new lower bound and a heuristic approach for the problem. The proposed lower bound can be computed in polynomial time and it is provably better than some previously known lower bounds. We use it within a bounded beam search algorithm to solve the Block Relocation Problem and show that the considered heuristic approach outperforms the other existing algorithms on most of the instances in the literature. In order to test the approaches on real-size dimensions, new large instances of the Block Relocation Problem are also introduced. (C) 2018 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available