A new heuristic combining A* search and CP-SAT solves the Multi-AMR buffer storage/reshuffling problem hundreds to thousands of times faster than an exact IP, with median gaps of 2.6–14.6%.
Managing Relocation and Delay in Container Terminals with Flexible Service Policies
1 Pith paper cite this work, alongside 8 external citations. Polarity classification is still indexing.
abstract
We introduce a new model and mathematical formulation for planning crane moves in the storage yard of container terminals. Our objective is to develop a tool that captures customer centric elements, especially service time, and helps operators to manage costly relocation moves. Our model incorporates several practical details and provides port operators with expanded capabilities including planning repositioning moves in off-peak hours, controlling wait times of each customer as well as total service time, optimizing the number of relocations and wait time jointly, and optimizing simultaneously the container stacking and retrieval process. We also study a class of flexible service policies which allow for out-of-order retrieval. We show that under such flexible policies, we can decrease the number of relocations and retrieval delays without creating inequities.
fields
cs.RO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Multi-AMR Buffer Storage, Retrieval, and Reshuffling Problem: Exact and Heuristic Approaches
A new heuristic combining A* search and CP-SAT solves the Multi-AMR buffer storage/reshuffling problem hundreds to thousands of times faster than an exact IP, with median gaps of 2.6–14.6%.