A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:OF3APLFZrecord.jsonopen to challenge →
classification
math.OC
keywords
algorithmaisleoptimalpickerproblemroutingtourwarehouse
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.