Order Picker Routing Problem in A Single Block Warehouse
The Order Picker Routing Problem is a sub-problem of the Order Picking Problem in which the goal is to choose orders in such a way that storage costs and distances are minimized. The Picker Routing Problem (PRP) is an NP-Hard problem that can't be solved in a reasonable amount of time. Many heuristic algorithms have been developed in the literature to overcome this challenge. Some of the heuristics developed for PRP are studied in this study to solve PRP in an online retailer's warehouse. The results show that, when used in single-block warehouses, the Midpoint Routing Heuristic performs better on average than other routing heuristics.
- Cilt:6 Sayı:1 (2022)