Skip to main content

Advertisement

Log in

A rule-based heuristic algorithm for joint order batching and delivery planning of online retailers with multiple order pickers

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Today with the rapid improvement of new technologies, people tend to buy various products from online retailers which facilitate the purchasing process and save their valuable limited time. Two important and interconnected operations of each online retailing system are order picking and delivery planning. In an online system, lots of small orders including different products arrive dynamically and must be delivered on time, so there is a limited time to retrieve products from their storage locations, pack them, load onto trucks, and deliver to the destinations. In this study, we deal with these two problems of an online retailer that stores a variety of products in a warehouse and sells them online through their website. A rule-based heuristic algorithm is proposed which integrates decisions of order batching, picking schedule of batches, and assigning orders to trucks as well as, scheduling and routing of trucks. Three different batching methods including two well- known heuristics and a genetic algorithm have been used. An extensive numerical experiment is carried out to show the efficiency of the rule-based algorithm and investigate the results of using each batching method for different problem sizes. It is demonstrated that while the algorithm has efficient performance with three used batching methods, the genetic algorithm can lead to less system cost and more order pickers productivity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Alipour M, Mehrjedrdi YZ, Mostafaeipour A (2020) A rule-based heuristic algorithm for on-line order batching and scheduling in an order picking warehouse with multiple pickers. RAIRO-Oper Res 54(1):101–107

  2. Azadnia, AH, S Taheri, P Ghadimi, MZ Mat Saman and KY Wong (2013) “Order batching in warehouses by minimizing total tardiness: a hybrid approach of weighted association rule mining and genetic algorithms.” Sci World J 2013

  3. Bukchin Y, Khmelnitsky E, Yakuel P (2012) Optimizing a dynamic order-picking process. Eur J Oper Res 219(2):335–346

    Article  MathSciNet  Google Scholar 

  4. Cano, JA, AA Correa-Espinal and RA Gomez-Montoya (2018). “A review of research trends in order batching, sequencing and picker routing problems.” Revista ESPACIOS 39(04)

  5. Chen F, Wei Y, Wang H (2018) A heuristic based batching and assigning method for online customer orders. Flex Serv Manuf J 30(4):640–685

    Article  Google Scholar 

  6. Chen T-L, Cheng C-Y, Chen Y-Y, Chan L-K (2015) An efficient hybrid algorithm for integrated order batching, sequencing and routing problem. Int J Prod Econ 159:158–167

    Article  Google Scholar 

  7. Chew EP, Tang LC (1999) Travel time analysis for general item location assignment in a rectangular warehouse. Eur J Oper Res 112(3):582–597

    Article  Google Scholar 

  8. Chirici L, Wang K-S (2014) Tackling the storage problem through genetic algorithms. Adv Manuf 2(3):203–211

    Article  Google Scholar 

  9. De Koster M, Van der Poort ES, Wolters M (1999) Efficient orderbatching methods in warehouses. Int J Prod Res 37(7):1479–1504

    Article  Google Scholar 

  10. De Koster R (2003) Distribution strategies for online retailers. IEEE Trans Eng Manag 50(4):448–457

    Article  Google Scholar 

  11. De Koster R, Le-Duc T, Roodbergen KJ (2007) Design and control of warehouse order picking: a literature review. Eur J Oper Res 182(2):481–501

    Article  Google Scholar 

  12. Elsayed E, Lee M-K (1996) Order processing in automated storage/retrieval systems with due dates. IIE Trans 28(7):567–577

    Article  Google Scholar 

  13. Elsayed E, Lee M-K, Kim S, Scherer E (1993) Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals. Int. J Prod Res 31(3):727–738

  14. Gademann N, Velde S (2005) Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans 37(1):63–75

    Article  Google Scholar 

  15. Giannikas V, Lu W, Robertson B, McFarlane D (2017) An interventionist strategy for warehouse order picking: evidence from two case studies. Int J Prod Econ 189:63–76

    Article  Google Scholar 

  16. Gong Y, De Koster R (2008) A polling-based dynamic order picking system for online retailers. IIE Trans 40(11):1070–1082

    Article  Google Scholar 

  17. Henn S (2012) Algorithms for on-line order batching in an order picking warehouse. Comput Oper Res 39(11):2549–2563

    Article  Google Scholar 

  18. Henn S (2015) Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses. Flex Serv Manuf J> 27(1):86–114

    Article  Google Scholar 

  19. Henn S, Schmid V (2013) Metaheuristics for order batching and sequencing in manual order picking systems. Comput Ind Eng 66(2):338–351

    Article  Google Scholar 

  20. Ho Y-C, Tseng Y-Y (2006) A study on order-batching methods of order-picking in a distribution Centre with two cross-aisles. Int J Prod Res 44(17):3391–3417

    Article  Google Scholar 

  21. Hsu C-M, Chen K-Y, Chen M-C (2005) Batching orders in warehouses by minimizing travel distance with genetic algorithms. Comput Ind 56(2):169–178

    Article  Google Scholar 

  22. Koch S, Wäscher G (2016) A grouping genetic algorithm for the order batching problem in distribution warehouses. J Bus Econ 86(1–2):131–153

    Google Scholar 

  23. Le-Duc T (2005) Design and control of efficient order picking processes. PhD thesis, RSM Erasmus University

  24. Lu W, McFarlane D, Giannikas V, Zhang Q (2016) An algorithm for dynamic order-picking in warehouse operations. Eur J Oper Res 248(1):107–122

    Article  MathSciNet  Google Scholar 

  25. Menéndez B, Bustillo M, Pardo EG, Duarte A (2017) General variable neighborhood search for the order batching and sequencing problem. Eur J Oper Res 263(1):82–93

    Article  MathSciNet  Google Scholar 

  26. Moons S, Braekers K, Ramaekers K, Caris A, Arda Y (2019) The value of integrating order picking and vehicle routing decisions in a B2C e-commerce environment. Int J Prod Res 57(20):6405–6423

    Article  Google Scholar 

  27. Moons S, Ramaekers K, Caris A and Arda Y (2017) Integration of order picking and vehicle routing in a B2C e-commerce context.” Flex serv manuf j: 1–31

  28. Onal S, Zhang J and Das S (2017) Modelling and performance evaluation of explosive storage policies in internet fulfilment warehouses.” International Journal of Production Research: 1–14

  29. Pérez-Rodríguez, R, A Hernández-Aguirre and S Jöns (2015) A continuous estimation of distribution algorithm for the online order-batching problem.” Int j adv manuf syst 79

  30. Ramaekers K, Caris A, Moons S, van Gils T (2018) Using an integrated order picking-vehicle routing problem to study the impact of delivery time windows in e-commerce. Eur transp res rev 10(2):56

  31. Richards G (2017) Warehouse management: a complete guide to improving efficiency and minimizing costs in the modern warehouse, Kogan Page Publishers

  32. Schleyer M, Gue K (2012) Throughput time distribution analysis for a one-block warehouse. Transp res e logist transp rev 48(3):652–666

  33. Scholz A, Schubert D, Wäscher G (2017) 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

  34. Torabbeigi, M, GJ Lim, SJ Kim (2018). Drone delivery schedule optimization considering the reliability of drones. 2018 international conference on unmanned aircraft systems (ICUAS), IEEE

  35. Torabbeigi, M, Lim GJ, Kim SJ (2019) Drone delivery scheduling optimization considering payload-induced cattery consumption rates.” J Intell Robot Syst 1–17

  36. Tsai C-Y, Liou JJ, 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

    Article  Google Scholar 

  37. Van Nieuwenhuyse I, de Koster RB (2009) Evaluating order throughput time in 2-block warehouses with time window batching. Int J Prod Econ 121(2):654–664

    Article  Google Scholar 

  38. Xu X, Liu T, Li K, Dong W (2014) Evaluating order throughput time with variable time window batching. Int j prod res 52(8):2232–2242

  39. Yu M, De Koster RB (2009) The impact of order batching and picking area zoning on order picking system performance. Eur J Oper Res 198(2):480–490

    Article  Google Scholar 

  40. Zhang J, Liu F, Tang J, Li Y (2019) The online integrated order picking and delivery considering pickers’ learning effects for an O2O community supermarket. Transp Res E Logist Transp Rev 123:180–199

  41. Zhang J, Wang X, Chan FT, Ruan J (2017) On-line order bathing and sequencing problem with multiple pickers: a hybrid rule-based algorithm. Appl Math Model 45:271–284

    Article  MathSciNet  Google Scholar 

  42. Zhang J, Wang X, Huang K (2016) Integrated on-line scheduling of order batching and delivery under B2C e-commerce. Comput Ind Eng 94:280–289

    Article  Google Scholar 

  43. Zhang J, Wang X, Huang K (2018) On-line scheduling of order picking and delivery with multiple zones and limited vehicle capacity. Omega 79:104–115

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fariborz Jolai.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hossein Nia Shavaki, F., Jolai, F. A rule-based heuristic algorithm for joint order batching and delivery planning of online retailers with multiple order pickers. Appl Intell 51, 3917–3935 (2021). https://doi.org/10.1007/s10489-020-01843-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-020-01843-9

Keywords

Navigation