Modified Dynamic Programming Algorithms for Order Picking in Single-Block and Two-Block Rectangular Warehouses
Recent research has shown that optimal picker tours in rectangular warehouses exhibit deterministic travel patterns within each aisle, and that certain previously considered traversals are unnecessary. Using these insights, this paper proposes modifications to dynamic programming algorithms that improve computational efficiency...