6 papers · 1 filter
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…
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…
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…
Double Traversals in Optimal Picker Routes for Warehouses with Multiple Blocks
George Dunn, Hadi Charkhgard, Ali Eshragh +1
Order picking is a process that involves collecting items from their respective locations within a warehouse. There exist dynamic programming algorithms for finding the minimal pic…
Deep Reinforcement Learning for Dynamic Order Picking in Warehouse Operations
Sasan Mahmoudinazlou, Abhay Sobhanan, Hadi Charkhgard +2
Order picking is a pivotal operation in warehouses that directly impacts overall efficiency and profitability. This study addresses the dynamic order picking problem, a significant…
Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data
Elizabeth Harris, Ali Eshragh, Bishnu Lamichhane +2
The Minimum Volume Covering Ellipsoid (MVCE) problem, characterised by observations in dimensions where , can be computationally very expensive in the big data reg…