An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules
From MaRDI portal
Publication:2171596
DOI10.1016/j.ejor.2022.04.006OpenAlexW4225608268WikidataQ114184288 ScholiaQ114184288MaRDI QIDQ2171596
Publication date: 9 September 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.04.006
Related Items
The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ A new modeling approach for the unrestricted block relocation problem
Cites Work
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- Solving the container relocation problem by an improved greedy look-ahead heuristic
- An improved mathematical formulation for the blocks relocation problem
- Container relocation problem with time windows for container departure
- On the abstraction method for the container relocation problem
- A tree search procedure for the container pre-marshalling problem
- A mathematical formulation and complexity considerations for the blocks relocation problem
- Applying the corridor method to a blocks relocation problem
- A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations
- A new effective unified model for solving the pre-marshalling and block relocation problems
- An optimization model for the container pre-marshalling problem
- The bounded beam search algorithm for the block relocation problem
- New insights on the block relocation problem
- An exact algorithm for the unrestricted block relocation problem
- An exact algorithm for the blocks relocation problem with new lower bounds
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- An algorithm with performance guarantee for the online container relocation problem
- A feasibility-based heuristic for the container pre-marshalling problem
- An efficient ant colony optimization algorithm for the blocks relocation problem
- Integer programming models for the pre-marshalling problem
- A tree search procedure for the container relocation problem
- A local-search based heuristic for the unrestricted block relocation problem
- A branch-and-cut algorithm for the restricted block relocation problem
- Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018)
- An exact approach to the restricted block relocation problem based on a new integer programming formulation
- Storage yard operations in container terminals: literature overview, trends, and research directions
- An exact algorithm for the block relocation problem with a stowage plan
- A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem
- A multi-heuristic approach for solving the pre-marshalling problem
- Tree search for the stacking problem
- A branch and bound approach for large pre-marshalling problems
- A heuristic rule for relocating blocks
- A heuristic for retrieving containers from a yard
- Heuristic search for the stacking problem
- The assignment of storage locations to containers for a container stack
- A mathematical formulation and efficient heuristics for the dynamic container relocation problem
- A tree search heuristic for the container retrieval problem
- On the completeness of a generalized matching problem
- Mathematical formulation and heuristic algorithm for the block relocation and loading problem
