Optimization of partially ordered container relocation problem with rolled containers

DOI10.1016/J.COR.2026.107434MaRDI QIDQ7255483zbMATH OpenFDO

Authors Ning Wang, Xinyu Ma, Ruobing Yang, Jingjing Hu

Publication date 1 June 2026

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2026.107434

zbMATH Keywords

CRPGRASP algorithmIP modelspartially orderedrolled containers

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch-and-cut algorithm for the restricted block relocation 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 new binary formulation of the restricted container relocation problem based on a binary encoding of configurations
• 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 exact algorithm for the block relocation problem with a stowage plan
• 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
• An improved mathematical formulation for the blocks relocation problem
• Mathematical formulation and heuristic algorithm for the block relocation and loading problem
• Solving the container relocation problem by an improved greedy look-ahead heuristic
• Storage yard operations in container terminals: literature overview, trends, and research directions
• The assignment of storage locations to containers for a container stack

This page was built for publication: Optimization of partially ordered container relocation problem with rolled containers

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