Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories
In this work we investigate the problem of order batching and picker routing in inventories. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we consider the case of online grocery shopping in which orders may be composed of dozens of items. To the best of our knowledge, no exact algorithms have been proposed for this problem. We therefore introduce three integer programming formulations for the joint problem of batching and routing, one of them involving exponentially many constraints to enforce connectivity requirements and two compact formulations based on network flows. For the former we implement a branch-and-cut algorithm which separates connectivity constraints. We built a test instance generator, partially based on publicly-available real world data, in order to compare empirically the three formulations.
KeywordsOrder batching Picker routing Inventory management Integer programming
- 5.CPLEX Optimizer: IBM (2016). http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/. Accessed 8 Feb 2016
- 21.Lucena, A.: Steiner problem in graphs: Lagrangean relaxation and cutting planes. COAL Bull. 21(1), 2–8 (1992)Google Scholar
- 23.MySQL Foodmart Database (2008). http://pentaho.dlpage.phi-integration.com/mondrian/mysql-foodmart-database. Accessed 31 Jan 2016