4 papers
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…
Arc Routing Problems with Multiple Trucks and Drones: A Hybrid Genetic Algorithm
Abhay Sobhanan, Hadi Charkhgard, Changhyun Kwon
Arc-routing problems underpin numerous critical field operations, including power-line inspection, urban police patrolling, and traffic monitoring. In this domain, the Rural Postma…
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…
A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse
George Dunn, Hadi Charkhgard, Ali Eshragh +1
The order picker routing problem involves finding the optimal tour of a warehouse that collects all the required items on a given pick list. Ratliff and Rosenthal introduced a dyna…