An exact algorithm for the block relocation problem with a stowage plan
From MaRDI portal
Publication:2315632
DOI10.1016/J.EJOR.2019.06.014zbMath1430.90139OpenAlexW2951095576WikidataQ127713501 ScholiaQ127713501MaRDI QIDQ2315632
Publication date: 25 July 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.06.014
branch-and-bound algorithmcombinatorial optimizationlower boundsOR in maritime industryblock relocation problem with a stowage plan
Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (5)
Optimizing the number of deployed yard cranes in a container terminal ⋮ An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ The block relocation problem with appointment scheduling ⋮ Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018)
Uses Software
Cites Work
- Unnamed Item
- 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
- On the abstraction method for the container relocation problem
- A biased random-key genetic algorithm for the container pre-marshalling 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
- 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 the robust container pre-marshalling problem
- The block retrieval problem
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- A feasibility-based heuristic for the container pre-marshalling problem
- An efficient ant colony optimization algorithm for the blocks relocation problem
- A tree search procedure for the container relocation problem
- 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
- A heuristic rule for relocating blocks
- A heuristic for retrieving containers from a yard
- A Branch and Price Procedure for the Container Premarshalling Problem
- The assignment of storage locations to containers for a container stack
This page was built for publication: An exact algorithm for the block relocation problem with a stowage plan
