The bounded beam search algorithm for the block relocation problem

DOI10.1016/J.COR.2018.11.008MaRDI QIDQ1634080zbMATH OpenOpenAlexWikidataFDO

Authors Tiziano Bacci, Sara Mattia, P. 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

zbMATH Keywords

beam searchblock relocationcontainer relocationheuristicslower boundrealistic instances

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• New insights on the block relocation problem
• An exact algorithm for the blocks relocation problem with new lower bounds
• 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
• An exact algorithm for the unrestricted block relocation problem

Cites work

• A biased random-key genetic algorithm for the container pre-marshalling problem
• A heuristic for retrieving containers from a yard
• A heuristic rule for relocating blocks
• A mathematical formulation and complexity considerations for the blocks relocation problem
• A multi-heuristic approach for solving the pre-marshalling problem
• A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem
• A tree search procedure for the container relocation problem
• An algorithm with performance guarantee for the online container relocation problem
• An improved mathematical formulation for the blocks relocation problem
• An optimization model for the container pre-marshalling problem
• Applying the corridor method to a blocks relocation problem
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• Computational logistics. 9th international conference, ICCL 2018, Vietri Sul Mare, Italy, October 1--3, 2018. Proceedings
• Container relocation problem with time windows for container departure
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• New insights on the block relocation problem
• On the abstraction method for the container relocation problem
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
• Storage yard operations in container terminals: literature overview, trends, and research directions
• The assignment of storage locations to containers for a container stack
• The mutual exclusion scheduling problem for permutation and comparability graphs.

Cited in

(10)

• New insights on the block relocation problem
• A branch-and-cut algorithm for the restricted block relocation problem
• An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules
• Solving a large cutting problem in the glass manufacturing industry
• The block relocation problem with appointment scheduling
• An exact approach to the restricted block relocation problem based on a new integer programming formulation
• 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
• A constraint programming approach for the premarshalling problem
• A new modeling approach for the unrestricted block relocation problem

Describes a project that uses

Uses Software

• BRP

This page was built for publication: The bounded beam search algorithm for the block relocation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1634080)