Retrieval Sequencing in a Compact Storage System with Side Access
cs.DS, cs.CC
Submitted: 2026-10-29
Updated: 2026-10-29
License: http://creativecommons.org/licenses/by/4.0/
The gist: In a compact storage system with side access, bins are arranged in adjacent vertical stacks.
Abstract
In a compact storage system with side access, bins are arranged in adjacent vertical stacks. In each retrieval cycle, bins blocking access are lifted to create a temporary tunnel through which a robot extracts one requested bin from the side. The lifted bins are then lowered again, and the energy expenditure of the cycle equals the number of lifted bins. Given a pick list known in advance, we seek a retrieval order that minimizes total energy expenditure. For every number of stacks, we prove that the total energy separates into an instance constant and a pairwise penalty, and that every energy-optimal order is laminar within each stack. For two stacks, we prove that the retrieval sequencing problem is solvable in polynomial time. For three stacks, we give an exact polynomial-time reduction to a merge problem and characterize which merge-problem instances arise from the storage model. We define a recursive class of retrieval orders and construct a polynomial-time dynamic program that minimizes energy expenditure over this class. Finally, we quantify the additional energy savings from batching, which allows several requested bins to be retrieved in one cycle.
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles