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

DOI10.1016/J.EJOR.2020.05.029MaRDI QIDQ2023911zbMATH OpenOpenAlexFDO

Authors Tiziano Bacci, Sara Mattia, P. Ventura

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

block relocation problembranch-and-cutinteger programming formulation

Mathematics Subject Classification ID

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

Recommendations

• An exact approach to the restricted block relocation problem based on a new integer programming formulation
• An exact algorithm for the block relocation problem with a stowage plan
• New insights on the block relocation problem
• An exact algorithm for the unrestricted block relocation problem
• A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem

Cites work

• A heuristic rule for relocating blocks
• A mathematical formulation and complexity considerations for the 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 efficient ant colony optimization algorithm for the blocks relocation problem
• An exact algorithm for the blocks relocation problem with new lower bounds
• An exact algorithm for the unrestricted block relocation problem
• An improved mathematical formulation for the blocks relocation problem
• Applying the corridor method to a blocks relocation problem
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• 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
• The assignment of storage locations to containers for a container stack
• The bounded beam search algorithm for the block relocation problem
• The mutual exclusion scheduling problem for permutation and comparability graphs.

Cited in

(23)

• 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 efficient ant colony optimization algorithm for the blocks relocation problem
• A local-search based heuristic for the unrestricted block relocation problem
• New integer programming models for slab stack shuffling problems
• 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
• The block relocation problem with appointment scheduling
• An exact approach to the restricted block relocation problem based on a new integer programming formulation
• An exact algorithm for the block relocation problem with a stowage plan
• On the integer programming formulation for the relaxed restricted container relocation problem
• An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes
• An improved mathematical formulation for the blocks relocation problem
• A mathematical formulation and complexity considerations for the blocks relocation problem
• 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
• The blocks relocation problem with item families minimizing the number of reshuffles
• A new modeling approach for the unrestricted block relocation problem
• The parallel stack loading problem of minimizing the exact number of relocations
• A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations
• Optimization of partially ordered container relocation problem with rolled containers

Describes a project that uses

Uses Software

• BRP
• GitHub

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

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