Abstract
We present an evolutionary algorithm to solve a combination of the Order Batching and Order Picking problems. This integrated problem consists of selecting and picking up batches of various items requested by customers from a storage area, given a deadline for finishing each order according to a delivery plan. We seek to find the plan that minimizes the total cost of picking the goods, proportional to the time devoted to traverse the storage facility, grabbing the good and leaving it at the dispatch area. Earliness and tardiness induce inefficiency costs due to the excess use of space or breaching the delivery contracts. The results of running the algorithm compare favorably to those reported in the literature.
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
Similar content being viewed by others
Notes
- 1.
We denote with {0, n + 1} the start and end at the dispatch area.
References
De Koster, R., Van der Poort, E.S., Wolters, M.: Efficient order batching methods in warehouses. Int. J. Prod. Res. 37(7), 1479–1504 (1999)
De Koster, R., Le-Duc, T., Roodbergen, K.J.: Design and control of warehouse order picking: a literature review. Eur. J. Oper. Res. 182(2), 481–501 (2007)
Miguel, F., Frutos, M., Tohmé, F., Rossit, D.A.: A memetic algorithm for the integral OBP/OPP problem in a logistics distribution center. Uncertain Supply Chain Manag. 7(2019), 203–214 (2019)
Chen, M.C., Wu, H.P.: An association-based clustering approach to order batching considering customer demand patterns. Omega 33(4), 333–343 (2005)
Henn, S., Koch, S., Wäscher, G.: Order batching in order picking warehouses: a survey of solution approaches. In: Manzini, R. (ed.) Warehousing in the Global Supply Chain, pp. 105–137. Springer, London (2012). https://doi.org/10.1007/978-1-4471-2274-6_6
Henn, S., Schmid, V.: Metaheuristics for order batching and sequencing in manual order picking systems. Comput. Ind. Eng. 66(2), 338–351 (2013)
Henn, S., Wäscher, G.: Tabu search heuristics for the order batching problem in manual order picking systems. Eur. J. Oper. Res. 222(3), 484–494 (2012)
Henn, S., Koch, S., Doerner, K., Strauss, C., Wäscher, G.: Metaheuristics for the order batching problem in manual order picking systems. Bus. Res. 3(1), 82–105 (2010)
Hwang, H., Kim, D.: Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system. Eur. J. Oper. Res. 43(17), 3657–3670 (2005)
Rana, K.: Order-picking in narrow-aisle warehouse. Int. J. Phys. Distrib. Logist. 20(2), 9–15 (1991)
Tsai, C.Y., Liou, J.J., Huang, T.M.: 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 (2008)
Grosse, E.H., Glock, C.H.: The effect of worker learning on manual order picking processes. Int. J. Prod. Econ. 170(C), 882–890 (2015)
Lam, C.H., Choy, K.L., Ho, G.T., Lee, C.K.: An order-picking operations system for managing the batching activities in a warehouse. Int. J. Syst. Sci. 45(6), 1283–1295 (2014)
Van Gils, T., Ramaekers, K., Braekers, K., Depaire, B., Carisa, A.: Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions. Int. J. Prod. Econ. 197, 243–261 (2018)
Ho, Y.C., Tseng, Y.Y.: A study on order-batching methods of order-picking in a distribution centre with two cross-aisles. Int. J. Prod. Res. 44(17), 3391–3471 (2006)
Scholz, A., Schubert, D., Wäscher, G.: Order picking with multiple pickers and due dates - Simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems. Eur. J. Oper. Res. 263(2), 461–478 (2017)
Ardjmand, E., Shakeri, H., Singh, M., Bajgiran, O.S.: Minimizing order picking makespan with multiple pickers in a wave picking warehouse. Int. J. Prod. Econ. 206, 169–183 (2018)
Öztürkoğlu, Ö., Hoser, D.: A discrete cross aisle design model for order-picking warehouses. Eur. J. Oper. Res. 275(2), 411–430 (2018)
Tappia, E., Roy, D., Melacini, M., De Koster, R.: Integrated storage-order picking systems: Technology, performance models, and design insights. Eur. J. Oper. 274(3), 947–965 (2018)
Lu, W., McFarlane, D., Giannikas, V., Zhang, Q.: An algorithm for dynamic order-picking in warehouse operations. Eur. J. Oper. Res. 248(1), 107–122 (2016)
Petersen, C.G.: An evaluation of order picking routeing policies. Int. J. Oper. Prod. Manag. 17(11), 1098–1111 (1997)
Žulj, I., Glock, C.H., Grosse, E.H., Schneider, M.: Picker routing and storage-assignment strategies for precedence-constrained order picking. Comput. Ind. Eng. 123, 338–347 (2018)
Theys, C., Bräysy, O., Dullaert, W., Raa, B.: Using a TSP heuristic for routing order pickers in warehouses. Eur. J. Oper. Res. 200, 755–763 (2010)
Wetzel, A.: Evaluation of the Effectiveness of Genetic Algorithms in Combinatorial Optimization. University of Pittsburgh, Pittsburgh (1983)
Whitley, L.D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesmen: the genetic edge recombination operator. In: Proceedings of the 3rd International Conference on Genetic Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, pp. 133–140 (1989)
Fogel, D.B.: An evolutionary approach to the traveling salesman problem. Biol. Cybern. 60(2), 139–144 (1988)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Miguel, F.M., Frutos, M., Méndez, M., Tohmé, F. (2021). Solving Order Batching/Picking Problems with an Evolutionary Algorithm. In: Rossit, D.A., Tohmé, F., Mejía Delgadillo, G. (eds) Production Research. ICPR-Americas 2020. Communications in Computer and Information Science, vol 1407. Springer, Cham. https://doi.org/10.1007/978-3-030-76307-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-76307-7_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-76306-0
Online ISBN: 978-3-030-76307-7
eBook Packages: Computer ScienceComputer Science (R0)