A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse

2024/09/20 by George Dunn, Hadi Charkhgard, Dunn, George +5
Computer Science · Engineering · #Advanced Manufacturing and Logistics Optimization #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Packing Problems #Optimization and Search Problems

paper · pdf · doi:10.48550/arxiv.2409.13219

openalex publication_date 2024/09/20 · openalex created_date 2024/10/26 · openalex updated_date 2026/07/28

Abstract

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 dynamic programming algorithm for solving this problem in polynomial time by sequentially adding edges inside and between each aisle to construct a tour. We provide a method where only transitions from one aisle to the next are considered, significantly reducing the number of stages in the algorithm.

Related

• Modeling Single Picker Routing Problems in Classical and Modern\n Warehouses
• Double Traversals in Optimal Picker Routes for Warehouses with Multiple Blocks
• Improved formulations of the joint order batching and picker routing problem
• Deterministic Structure of Vertical Configurations in Minimal Picker Tours for Rectangular Warehouses
• Solving the Joint Order Batching and Picker Routing Problem for Large Instances