A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension

DOI10.1016/j.cor.2021.105585OpenAlexW3207904074MaRDI QIDQ2669688

Zhou Xu, Jun Xia, Hong Ma, Tian-tian Wang

Publication date: 9 March 2022

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

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105585

zbMATH Keywords

dynamic programmingheuristiccontainer terminalstime dimensionyard allocation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions

Cites Work

• A skyline heuristic for the 2D rectangular packing and strip packing problems
• A column generation heuristic for a dynamic generalized assignment problem
• Three-dimensional bin packing problem with variable bin height
• Deriving decision rules to locate export containers in container yards
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
• A critical-shaking neighborhood search for the yard allocation problem
• The Three-Dimensional Bin Packing Problem
• Port space allocation with a time dimension

This page was built for publication: A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension