Abstract
Order picking is a warehouse function dealing with the retrieval of articles from their storage locations in order to satisfy a given demand specified by customer orders. Of all warehouse operations, order picking is considered to include the most cost-intensive ones. Even though there have been various attempts to automate the picking process, manual order picking systems are still prevalent in practice. This chapter will focus on order batching, a central planning issue in order picking systems. Order batching has been proven to be pivotal for the efficiency of order picking operations. Improved order batching reduces the total picking time required to collect the requested articles. According to experience from practice, this can result in significant savings of labour cost and in a reduction of the customer order’s delivery lead time. The aim of this contribution is to provide comprehensive insights into order batching by giving a detailed state-of-the-art overview of the different solution approaches which have been suggested in the literature. Corresponding to the available publications, the emphasis will be on static order batching. In addition to this, the chapter will also review the existing literature for variants and extensions of static order batching. Furthermore, solution approaches for dynamic order batching problems will be presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Albareda-Sambola M, Alonso-Ayuso A, Molina E, de Blas CS (2009) Variable neighborhood search for order batching in a warehouse. Asia–Pacific J Oper Res 26:655–683. doi:10.1142/S0217595909002390
Bozer YA, Kile JW (2008) Order batching in walk-and-pick order picking systems. Int J Prod Res 46:1887–1909. doi:10.1080/00207540600920850
Bullnheimer B, Hartl RF, Strauss C (1999) A new rank based version of the ant system—a computational study. Cent Eur J Oper Res 7:25–38. doi:10.1.1.49.4735
Caron F, Marchet G, Perego A (2000) Optimal layout in low-level picker-to-part systems. Int J Prod Res 38:101–117. doi:10.1080/002075400189608
Chen MC, Wu HP (2005) An association-based clustering approach to order batching considering customer demand patterns. Omega—Int J Manag Sci 33:333–343. doi:10.1016/j.omega.2004.05.003
Chew E, Tang L (1999) Travel time analysis for general item location assignment in a rectangular warehouse. Eur J Oper Res 112:582–597. doi:10.1016/S0377-2217(97)00416-5
Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581. doi:10.1287/opre.12.4.568
Coyle JJ, Bardi EJ, Langley CJ (1996) The management of business logistics, 6th edn. West Publishing Company, St. Paul, p 504
de Koster R, Roodbergen KJ, van Voorden R (1999a) Reduction of walking time in the center of De Bijenkorf. In: Speranza MG, Stähly P (eds) New trends in distribution logistics. Springer, Berlin, pp 215–234
de Koster R, van der Poort E, Wolters M (1999b) Efficient orderbatching methods in warehouses. Int J Prod Res 37:1479–1504. doi:10.1080/002075499191094
de Koster R, Le-Duc T, Roodbergen KJ (2007) Design and control of warehouse order picking: a literature review. Eur J Oper Res 182:481–501. doi:10.1016/j.ejor.2006.07.009
Drury J (1988) Towards more efficient order picking. The Institute of Materials Management, Cranfield
Elsayed EA (1981) Algorithms for optimal material handling in automatic warehousing systems. Int J Prod Res 19:525–535. doi:10.1080/00207548108956683
Elsayed EA, Lee MK (1996) Order processing in automated storage/retrieval systems with due dates. IIE Trans 28:567–577
Elsayed EA, Stern RG (1983) Computerized algorithms for order processing in automated warehousing systems. Int J Prod Res 21:579–586. doi:10.1080/00207548308942392
Elsayed EA, Unal OI (1989) Order batching algorithms and travel-time estimation for automated storage/retrieval systems. Int J Prod Res 27:1097–1114. doi:10.1080/00207548908942610
Elsayed EA, Lee MK, Kim S, Scherer E (1993) Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals. Int J Prod Res 31:727–738. doi:10.1080/00207549308956753
Frazelle E (2002) World-class warehousing and material handling. McGraw-Hill, New York
Gademann N, van de Velde S (2005) Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans 37:63–75. doi:10.1080/07408170590516917
Gademann N, van den Berg JP, van der Hoff HH (2001) An order batching algorithm for wave picking in a parallel-aisle warehouse. IIE Trans 33:385–398. doi:10.1023/A:1011049113445
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H Freeman and Co, New York
Gibson DR, Sharp GP (1992) Order batching procedures. Eur J Oper Res 58:57–67. doi:10.1016/0377-2217(92)90235-2
Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput and Oper Res 13:533–549. doi:10.1016/0305-0548(86)90048-1
Gu J, Goetschalckx M, McGinnis LF (2007) Research on warehouse operation: a comprehensive review. Eur J Oper Res 177:1–21. doi:10.1016/j.ejor.2006.02.025
Hall RW (1993) Distance approximations for routing manual pickers in a warehouse. IIE Trans 25:76–87. doi:10.1080/07408179308964306
Henn S (2010) Algorithms for on-line order batching in an order-picking warehouse, Proceedings of the 3rd international conference on information systems, Logistics and Supply Chain ILS 2010, Casablanca, April 2010, Business Process Consulting
Henn S, Wäscher G (2010) Tabu search heuristics for the order batching problem in manual order picking systems. Working Paper No. 07/2010, Faculty of Economics and Management, Otto von Guericke University Magdeburg
Henn S, Koch S, Doerner K, Strauss C, Wäscher G (2010) Metaheuristics for the order batching problem in manual order picking systems. BuR—Bus Res 3:82–105 (urn:nbn:de:0009–20–25082)
Ho YC, Tseng YY (2006) A study on order-batching methods of order-picking in a distribution center with two cross aisles. Int J Prod Res 44:3391–3417. doi:10.1080/00207540600558015
Ho YC, Su TS, Shi ZB (2008) Order-batching methods for an order-picking warehouse with two cross aisles. Comput Ind Eng 55:321–347. doi:10.1016/j.cie.2007.12.018
Hsu CM, Chen KY, Chen MC (2005) Batching orders in warehouses by minimizing travel distance with genetic algorithms. Comput Ind 56:169–178. doi:10.1016/j.compind.2004.06.001
Jarvis JM, McDowell ED (1991) Optimal product layout in an order picking warehouse. IIE Trans 23:93–102. doi:10.1080/07408179108963844
Kamin N (1998) On-line optimization of order picking in an automated warehouse. Shaker, Aachen
Le-Duc T, de Koster R (2007) Travel time estimation and order batching in a 2-block warehouse. Eur J Oper Res. 176:374–388. doi:10.1016/j.ejor.2005.03.052
Pan JCH, Liu S (1995) A comparative study of order batching algorithms. Omega—Int J Manag Sci 23:691–700. doi:10.1016/0305-0483(95)00038-0
Petersen CG, Schmenner RW (1999) An evaluation of routing and volume-based storage policies in an order picking operation. Decis Sci 30:481–501. doi:10.1111/j.1540-5915.1999.tb01619.x
Pohl L, Meller R, Gue K (2009) Optimizing fishbone aisles for dual-command operations in a warehouse. Nav Res Logist 56:389–403. doi:10.1002/nav.20355
Ratliff HD, Rosenthal AR (1983) Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper Res 31:507–521. doi:10.1287/opre.31.3.50
Roodbergen KJ, de Koster R (2001) Routing methods for warehouses with multiple cross aisles. Int J Prod Res 39:1865–1883. doi:10.1080/00207540110028128
Rosenwein MB (1996) A comparison of heuristics for the problem of batching orders for warehouse selection. Int J Prod Res 34:657–664. doi:10.1080/00207549608904926
Ruben RA, Jacobs FR (1999) Batch construction heuristics and storage assignment strategies for walk/ride and pick systems. Manag Sci 45:575–596. doi:10.1287/mnsc.45.4.575
Tompkins JA, White JA, Bozer YA, Frazelle E, Tanchoco JMA (2003) Facilities planning, 3rd edn. Wiley, New Jersey
Tsai CY, Liou JJH, Huang TM (2008) Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time. Int J Prod Res 46:6533–6555. doi:10.1080/00207540701441947
van Nieuwenhuyse I, de Koster R (2009) Evaluating order throughput time in 2-block warehouses with time window batching. Int J Prod Econ 121:654–664. doi:10.1016/j.ijpe.2009.01.013
Wäscher G (2004) Order picking: a survey of planning problems and methods. In: Dyckhoff H, Lackes R, Reese J (eds) Supply chain management and reverse logistics. Springer, Berlin, pp 324–370
Whittley I, Smith G (2004) The attribute based hill climber. J Math Model Algorithms 3:167–178. doi:10.1023/B:JMMA.0000036583.17284.02
Won J, Olafsson S (2005) Joint order batching and order picking in warehouse operations. Int J Prod Res 43:1427–1442. doi:10.1080/00207540410001733896
Yu M, de Koster R (2009) The impact of order batching and picking area zoning on order picking system performance. Eur J Oper Res 198:480–490. doi:10.1016/j.ejor.2008.09.011
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Henn, S., Koch, S., Wäscher, G. (2012). Order Batching in Order Picking Warehouses: A Survey of Solution Approaches. In: Manzini, R. (eds) Warehousing in the Global Supply Chain. Springer, London. https://doi.org/10.1007/978-1-4471-2274-6_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2274-6_6
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2273-9
Online ISBN: 978-1-4471-2274-6
eBook Packages: EngineeringEngineering (R0)