A branch-and-cut algorithm for the restricted block relocation problem

DOI10.1016/j.ejor.2020.05.029zbMath1487.90428OpenAlexW3033096052MaRDI QIDQ2023911

Sara Mattia, Paolo Ventura, Tiziano Bacci

Publication date: 3 May 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.05.029

zbMATH Keywords

branch-and-cutblock relocation probleminteger programming formulation

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (10)

Smart stacking for import containers using customer information at automated container terminals ⋮ An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules ⋮ An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes ⋮ A constraint programming approach for the premarshalling problem ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling 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 ⋮ New integer programming models for slab stack shuffling problems

Uses Software

• GitHub
• BRP

Cites Work

• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• An improved mathematical formulation for the blocks relocation problem
• On the abstraction method for the container relocation 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
• 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
• The mutual exclusion scheduling problem for permutation and comparability graphs.
• 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
• An efficient ant colony optimization algorithm for the blocks relocation problem
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• A heuristic rule for relocating blocks
• The assignment of storage locations to containers for a container stack

This page was built for publication: A branch-and-cut algorithm for the restricted block relocation problem