Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 287, Issue 2, Pages 452-459Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2020.05.029
Keywords
Block Relocation problem; Integer Programming formulation; Branch-and-cut
Funding
- MIUR-PRIN 2015 grants [2015XAPRKF, 2015B5F27W, 20153TXRX9]
Ask authors/readers for more resources
We consider the Block Relocation Problem, that has a crucial role in the logistics of containers. It consists of minimizing the number of container relocations within a container bay/yard. Since the number of containers shipped worldwide grew dramatically in the last years, the problem has been widely investigated. Here we propose an exact algorithm for the restricted version of the Block Relocation Problem, based on a new integer linear programming formulation. We compare such new approach with the state-of-art exact methods. The computational results prove its effectiveness and show that it outperforms all the previously proposed procedures, in almost all the considered instances. (C) 2020 Elsevier B.V. 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