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

TL;DR

This paper presents a simplified and more efficient algorithm for optimal picker routing in single-block warehouses by focusing only on aisle-to-aisle transitions, reducing computational complexity.

Contribution

It introduces a modified algorithm that considers only aisle transitions, significantly reducing the number of stages compared to previous dynamic programming approaches.

Findings

Reduced computational complexity in routing calculations

Maintained optimality with simplified transition considerations

Potential for faster routing solutions in practical warehouse settings

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.