Approximate dynamic programming for container stacking

DOI10.1016/j.ejor.2023.02.034MaRDI QIDQ6113333

René Boschma, Martijn Mes, Leon R. de Vries

Publication date: 11 July 2023

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

zbMATH Keywords

approximate dynamic programmingcontainer relocation problemOR in maritime industrycontainer stackingintermodal transport

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Conservative allocation models for outbound containers in container terminals
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Container relocation problem with time windows for container departure
• A mathematical formulation and complexity considerations for the blocks relocation 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
• Deriving decision rules to locate export containers in container yards
• An algorithm with performance guarantee for the online container relocation problem
• A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem
• Operations research at container terminals: a literature update
• A heuristic rule for relocating blocks
• The assignment of storage locations to containers for a container stack
• Approximate Dynamic Programming by Practical Examples

This page was built for publication: Approximate dynamic programming for container stacking