Reducing unproductive travel times is an important optimization goal when picking orders in warehouses. A fundamental solution procedure for the so-called picker routing problem was developed by Ratliff and Rosenthal (1983). Although this algorithm is very efficient, in its original form it only works under very narrow constraints. Therefore, the solution method has been modified repeatedly over time and adapted to variations of the picker routing problem. The aim of this thesis is to identify and classify extensions of the algorithm by Ratliff and Rosenthal (1983) by means of a systematic literature review and to compare the modifications with the original algorithm.

Interested in this topic? Please read about the application procedure on our website!