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.
@article{arxiv.2409.13219,
title = {A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse},
author = {George Dunn and Hadi Charkhgard and Ali Eshragh and Elizabeth Stojanovski},
journal= {arXiv preprint arXiv:2409.13219},
year = {2024}
}