The bounded beam search algorithm for the block relocation problem
From MaRDI portal
Publication:1634080
DOI10.1016/j.cor.2018.11.008zbMath1458.90410OpenAlexW2900497133WikidataQ128928515 ScholiaQ128928515MaRDI QIDQ1634080
Tiziano Bacci, Sara Mattia, Paolo Ventura
Publication date: 17 December 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.11.008
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (9)
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 ⋮ A beam search algorithm for minimizing crane times in premarshalling problems ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ A constraint programming approach for the premarshalling problem ⋮ A new modeling approach for the unrestricted block relocation problem ⋮ The block relocation problem with appointment scheduling ⋮ An exact approach to the restricted block relocation problem based on a new integer programming formulation ⋮ A branch-and-cut algorithm for the restricted block relocation problem
Uses Software
Cites Work
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- 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 biased random-key genetic algorithm for the container pre-marshalling problem
- A mathematical formulation and complexity considerations for the blocks relocation problem
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- Applying the corridor method to a blocks relocation problem
- An optimization model for the container pre-marshalling problem
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- New insights on the block relocation problem
- 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 tree search procedure for the container relocation problem
- Computational logistics. 9th international conference, ICCL 2018, Vietri Sul Mare, Italy, October 1--3, 2018. Proceedings
- Storage yard operations in container terminals: literature overview, trends, and research directions
- 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
- Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
- A heuristic rule for relocating blocks
- A heuristic for retrieving containers from a yard
- The assignment of storage locations to containers for a container stack
This page was built for publication: The bounded beam search algorithm for the block relocation problem
