Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
