The order batching problem: A state-of-the-art review

Abstract

The Order Batching Problem (OBP) has received a lot of attention from researchers in recent years. Until now, this problem has been considered as a whole with different problems or it has been studied on its own, with different solution methods, in different warehouse layouts, with different data structures. The aim of this study is to provide the researchers with a general analysis for studies using the OBP. In accordance with this purpose; the OBP is analyzed by an extensive literature review that includes all relevant studies to date. This literature review is based on a specific method and the studies are grouped into specific classes. Accordingly, the most studied problem with the OBP is the Picker Routing Problem (PRP) with 17% and 51% of the studies were solved by metaheuristic algorithms. The most widely used metaheuristic algorithms are Neighborhood Search and Genetic Algorithms.