Abstract
Order picking is a warehouse function that deals with the retrieval of articles from their storage locations in order to satisfy certain customer demands. Combining several single customer orders into one (more substantial) picking order can increase the efficiency of warehouse operations. The Order Batching Problem considered in this paper deals with the question of how different customer orders should be grouped into picking orders, such that the total length of all tours through the warehouse is minimized, which are necessary to collect all requested articles. For the solution of this problem, the authors introduce a grouping genetic algorithm. It is combined with a local search procedure which results in a highly competitive hybrid algorithm. In a series of extensive numerical experiments, the algorithm is benchmarked against a genetic algorithm with a standard item-oriented encoding scheme. The results show that the new genetic algorithm based on the group-oriented encoding scheme is preferable for the Order Batching Problem, and that the algorithm provides high quality solutions in reasonable computing times.
Similar content being viewed by others
References
Albareda-Sambola M, Alonso-Ayuso A, Molina E, de Bas CS (2009) Variable neighborhood search for order batching in a warehouse. Asia-Pac J Oper Res 26(5):655–683
Bozer YA, Kile JW (2008) Order batching in walk-and-pick order picking systems. Int J Prod Res 46(7):1887–1909
Chen M-C, Wu H-P (2005) An association-based clustering approach to order batching considering customer demand patterns. Omega 33(4):333–343
Chen M-C, Huang C-L, Chen K-Y, Wu H-P (2005) Aggregation of orders in distribution centers using data mining. Expert Syst Appl 28(3):453–460
Choe K, Sharp G (1991) Small part order picking: design and operation. http://www2.isye.gatech.edu/~mgoetsch/cali/Logistics%20Tutorial/order/article.htm
Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581
Coyle JJ, Bardi EJ, Langley CJ (2003) The management of business logistics, 7th edn. South-Western, Mason
de Koster R, van der Poort ES, Wolters M (1999a) Efficient orderbatching methods in warehouses. Int J Prod Res 37(7):1479–1504
de Koster R, Roodbergen KJ, van Voorden R (1999b) Reduction of walking time in the distribution center of De Bijenkorf. In: Speranza MG, Stähly P (eds) New trends in distribution logistics. Springer, Berlin, pp 215–234
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(5):525–535
Elsayed EA, Stern RG (1983) Computerized algorithms for order processing in automated warehousing systems. Int J Prod Res 21(4):579–586
Elsayed EA, Unal OI (1989) Order batching algorithms and travel-time estimation for automated storage/retrieval systems. Int J Prod Res 27(7):1097–1114
Falkenauer E (1992) The grouping genetic algorithms: widening the scope of the GAs. JORBEL Belg J Oper Res Stat Comput Sci 33(1,2):79–102
Falkenauer E (1995) Tapping the full power of genetic algorithm through suitable representation and local optimization: application to bin packing. In: Biethahn J, Nissen V (eds) Evolutionary algorithms in management applications. Springer, Berlin, pp 167–181
Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heuristics 2(1):5–30
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(1):63–75
Gibson DR, Sharp GP (1992) Order batching procedures. Eur J Oper Res 58(1):57–67
Goldberg DE (1989) Genetic algorithms in search optimization and machine learning. Addison-Wesley, Reading, MA
Gonçalves JF (2007) A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur J Oper Res 183(3):1212–1229
Henn S (2015) Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses. Flex Serv Manuf 27(1):86–114
Henn S, Schmid V (2013) Metaheuristics for order batching and sequencing in manual order picking systems. Comput Ind Eng 66(2):338–351
Henn S, Wäscher G (2012) Tabu search heuristics for the order batching problem in manual order picking systems. Eur J Oper Res 222(3):484–494
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(1):82–105
Henn S, Koch S, Wäscher G (2012) Order batching in order picking warehouses: a survey of solution approaches. In: Manzini R (ed) Warehousing in the global supply chain–advanced models, tools and applications for storage systems. Springer, London, pp 105–137
Henn S, Koch S, Gerking H, Wäscher G (2013) A U-shaped layout for manual order-picking systems. Logist Res 6(4):245–261
Ho Y-C, Su T-S, Shi Z-B (2008) Order-batching methods for an order-picking warehouse with two cross aisles. Comput Ind Eng 55(2):321–347
Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor
Hong S, Johnson AL, Peters BA (2012) Batch picking in narrow-aisle order picking systems with consideration for picker blocking. Eur J Oper Res 221(3):557–570
Hsu C-M, Chen K-Y, Chen M-C (2005) Batching orders in warehousees by minimizing travel distance with genetic algorithms. Comput Ind 56(2):169–178
Hwang H, Kim DG (2005) Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system. Int J Prod Res 43(17):3657–3670
Jarvis JM, McDowell ED (1991) Optimal product layout in an order picking system. IIE Trans 23(1):93–102
Kulak O, Sahin Y, Taner ME (2012) Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms. Flexible Services and Manufacturing Journal 24(1):52–80
Öncan T (2015) MILP formulations and an iterated local search algorithm with Tabu Thresholding for the order batching problem. Eur J Oper Res 243(1):142–155
Pan JC-H, Liu S (1995) A comparative study of order batching algorithms. Omega 23(6):691–700
Petersen CG, Aase G (2004) A comparison of picking, storage, and routing policies in manual order picking. Int J Prod Econ 92(1):11–19
Petersen CG, Schmenner RW (1999) An evaluation of routing and volume-based storage policies in an order picking operation. Decis Sci 30(2):481–501
Ratliff HD, Rosenthal AR (1983) Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper Res 31(3):507–521
Roodbergen KJ (2001) Layout and routing methods for warehouses. Ph.D. thesis, Erasmus University Rotterdam
Tompkins JA, White JA, Bozer YA, Tanchoco JMA (2010) Facilities planning, 4th edn. Wiley, New Jersey
Tsai C-Y, Liou JJH, Huang T-M (2008) Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time. Int J Prod Res 46(22):6533–6555
van Nieuwenhuyse I, de Koster R (2009) Evaluating order throughput time in 2-block warehouses with time window batching. Int J Prod Econ 121(2):654–664
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
Weicker K (2007) Evolutionäre Algorithmen, 2nd edn. Teubner, Wiesbaden
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(2):480–490
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Koch, S., Wäscher, G. A grouping genetic algorithm for the Order Batching Problem in distribution warehouses. J Bus Econ 86, 131–153 (2016). https://doi.org/10.1007/s11573-015-0789-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11573-015-0789-x