7 papers
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…
Reflections from Research Roundtables at the Conference on Health, Inference, and Learning (CHIL) 2025
Emily Alsentzer, Marie-Laure Charpignon, Bill Chen +90
The 6th Annual Conference on Health, Inference, and Learning (CHIL 2025), hosted by the Association for Health Learning and Inference (AHLI), was held in person on June 25-27, 2025…
Ranking Vectors Clustering: Theory and Applications
Ali Fattahi, Ali Eshragh, Babak Aslani +1
We study the problem of clustering ranking vectors, where each vector represents preferences as an ordered list of distinct integers. Specifically, we focus on the k-centroids rank…
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…