3 papers
math.OC2026
Deterministic Structure of Vertical Configurations in Minimal Picker Tours for Rectangular Warehouses
George Dunn, Elizabeth Stojanovski, Bishnu Lamichhane +2
The picker routing problem seeks the shortest tour through a warehouse that visits every item in a given pick-list and returns to the depot. For rectangular warehouses, dynamic pro…
math.OC2026
Double Traversals in Boundary Subaisles: Implications for Two-Block Layouts
George Dunn, Elizabeth Stojanovski, Bishnu Lamichhane +2
The order picking problem seeks the shortest warehouse route that visits all required item locations. Strict conditions are known for single-block rectangular layouts under which o…
math.OC2026
Modified Dynamic Programming Algorithms for Order Picking in Single-Block and Two-Block Rectangular Warehouses
George Dunn, Elizabeth Stojanovski, Bishnu Lamichhane +2
Recent research has shown that optimal picker tours in rectangular warehouses exhibit deterministic travel patterns within each aisle, and that certain previously considered traver…