An exact algorithm for the blocks relocation problem with new lower bounds
From MaRDI portal
Publication:1654367
DOI10.1016/J.COR.2018.06.021zbMath1458.90453OpenAlexW2837806110WikidataQ129565369 ScholiaQ129565369MaRDI QIDQ1654367
Kent E. Yucra Quispe, Carla Negri Lintzmayer, Eduardo Candido Xavier
Publication date: 8 August 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.06.021
Related Items (11)
An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules ⋮ A note on ``An exact algorithm for the blocks relocation problem with new lower bounds ⋮ On the integration of the parallel stack loading problem with the block relocation problem ⋮ A constraint programming approach for the premarshalling problem ⋮ A branch and bound approach for large pre-marshalling problems ⋮ A new modeling approach for the unrestricted block relocation problem ⋮ An exact approach to the restricted block relocation problem based on a new integer programming formulation ⋮ A local-search based heuristic for the unrestricted block relocation problem ⋮ A branch-and-cut algorithm for the restricted block relocation problem ⋮ An exact algorithm for the block relocation problem with a stowage plan ⋮ Deep learning assisted heuristic tree search for the container pre-marshalling problem
Uses Software
Cites Work
- On the abstraction method for the container relocation problem
- A mathematical formulation and complexity considerations for the blocks relocation problem
- Applying the corridor method to a blocks relocation problem
- Depth-first iterative-deepening: An optimal admissible tree search
- A heuristic rule for relocating blocks
- A heuristic for retrieving containers from a yard
- Unnamed Item
This page was built for publication: An exact algorithm for the blocks relocation problem with new lower bounds
