Skip to main content
SpringerLink
Log in

Basic VNS for a Variant of the Online Order Batching Problem

  • Conference paper
  • First Online:
Variable Neighborhood Search (ICVNS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12010))

Included in the following conference series:

Abstract

The Online Order Batching Problem is a combinatorial optimization problem related to the process of retrieving items within a warehouse. It appears in the context of warehousing, when the warehouse follows an order-batching picking policy, which means that orders are packed together into batches before been collected. Additionally, since this problem is online, orders are arriving to the warehouse continuously, which is usually due to the fact that orders come from an e-commerce platform. The variant of the problem tacked in this paper also considers an additional characteristic: there are multiple pickers available to collect the batches. In this paper we propose several strategies, based on the Variable Neighborhood Search methodology, to tackle the problem and we compare them with the algorithms in the state of the art, using previously referred data sets. Additionally, we test the influence of different routing strategies not used before in the context of this variant.

This research was partially funded by the projects: MTM2015-63710-P, RTI2018-094269-B-I00, TIN2015-65460-C2-2-P and PGC2018-095322-B-C22 from Ministerio de Ciencia, Innovación y Universidades (Spain); by Comunidad de Madrid and European Regional Development Fund, grant ref. P2018/TCS-4566; and by Programa Propio de I+D+i de la Universidad Politécnica de Madrid (Programa 466A).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Albareda-Sambola, M., Alonso-Ayuso, A., Molina, E., De Blas, C.S.: Variable neighborhood search for order batching in a warehouse. Asia Pac. J. Oper. Res. 26(5), 655–683 (2009)

    Article  MATH  Google Scholar 

  2. Ardjmand, E., Bajgiran, O.S., Youssef, E.: Using list-based simulated annealing and genetic algorithm for order batching and picker routing in put wall based picking systems. Appl. Soft Comput. 75, 106–119 (2019)

    Article  Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. Azadnia, A.H., Taheri, S., Ghadimi, P., Mat Saman, M.Z., Wong, K.Y.: Order batching in warehouses by minimizing total tardiness: a hybrid approach of weighted association rule mining and genetic algorithms. Sci. World J. 2013 (2013)

    Google Scholar 

  5. Bozer, Y.A., Kile, J.W.: Order batching in walk-and-pick order picking systems. Int. J. Prod. Res. 46(7), 1887–1909 (2008)

    Article  MATH  Google Scholar 

  6. Briant, O., Cambazard, H., Cattaruzza, D., Catusse, N., Ladier, A.L., Ogier, M.: A column generation based approach for the joint order batching and picker routing problem. In: ROADEF 2018 (2018)

    Google Scholar 

  7. Bué, M., Cattaruzza, D., Ogier, M., Semet, F.: An integrated order batching and picker routing problem. HAL (hal-01849980) (2018)

    Google Scholar 

  8. Bustillo, M., Menéndez, B., Pardo, E.G., Duarte, A.: An algorithm for batching, sequencing and picking operations in a warehouse. In: 2015 International Conference on Industrial Engineering and Systems Management (IESM), pp. 842–849, October 2015

    Google Scholar 

  9. Cano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A.: Solución del problema de conformación de lotes en almacenes utilizando algoritmos genéticos. Información tecnológica 29(6), 235–244 (2018)

    Article  Google Scholar 

  10. Chen, F., Wei, Y., Wang, H.: A heuristic based batching and assigning method for online customer orders. Flex. Serv. Manuf. J. 30(4), 640–685 (2018). https://doi.org/10.1007/s10696-017-9277-7

    Article  Google Scholar 

  11. Chew, E.P., Tang, L.C.: Travel time analysis for general item location assignment in a rectangular warehouse. Eur. J. Oper. Res. 112(3), 582–597 (1999)

    Article  MATH  Google Scholar 

  12. Coyle, J.J., Bardi, E.J., Langley, C.J., et al.: The Management of Business Logistics, vol. 6. West Publishing Company Minneapolis, St Paul (1996)

    Google Scholar 

  13. De Koster, M.B.M., Van der Poort, E.S., Wolters, M.: Efficient order batching methods in warehouses. Int. J. Prod. Res. 37(7), 1479–1504 (1999)

    Article  MATH  Google Scholar 

  14. de Koster, R., Roodbergen, K.J., van Voorden, R.: Reduction of walking time in the distribution center of De Bijenkorf. In: Speranza, M.G., Stähly, P. (eds.) New Trends in Distribution Logistics. Lecture Notes in Economics and Mathematical Systems, vol. 480, pp. 215–234. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-642-58568-5_11

    Chapter  MATH  Google Scholar 

  15. 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)

    Article  MATH  Google Scholar 

  16. Drury, J.: Towards more efficient order picking. IMM Monograph, No. 1 (1988)

    Google Scholar 

  17. Duarte, A., Pantrigo, J.J., Pardo, E.G., Mladenovic, N.: Multi-objective variable neighborhood search: an application to combinatorial optimization problems. J. Glob. Optim. 63(3), 515–536 (2015). https://doi.org/10.1007/s10898-014-0213-z

    Article  MathSciNet  MATH  Google Scholar 

  18. Duarte, A., Pantrigo, J.J., Pardo, E.G., Sánchez-Oro, J.: Parallel variable neighbourhood search strategies for the cutwidth minimization problem. IMA J. Manag. Math. 27(1), 55–73 (2016)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  20. Elsayed, E.A.: Algorithms for optimal material handling in automatic warehousing systems. Int. J. Prod. Res. 19(5), 525–535 (1981)

    Article  Google Scholar 

  21. van der Gaast, J.P., Jargalsaikhan, B., Roodbergen, K.J.: Dynamic batching for order picking in warehouses. In: 15th IMHRC Proceedings, Savannah, Georgia, USA (2018)

    Google Scholar 

  22. Gademann, A.J.R.M., Van Den Berg, J.P., Van Der Hoff, H.H.: An order batching algorithm for wave picking in a parallel-aisle warehouse. IIE Trans. 33(5), 385–398 (2001)

    Article  Google Scholar 

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

    Article  Google Scholar 

  24. Galka, S., Ulbrich, A., Günthner, W.: Performance calculation for order picking systems by analytical methods and simulation. Technical report, Technische Universität München, München, Germany (2008)

    Google Scholar 

  25. Gibson, D.R., Sharp, G.P.: Order batching procedures. Eur. J. Oper. Res. 58(1), 57–67 (1992)

    Article  Google Scholar 

  26. Gil-Borrás, S., Duarte, A., Alonso-Ayuso, A., Pardo, E.G.: Búsqueda de vecindad variable para el problema de la agrupación y recogida de pedidos online en almacenes logísticos. In: XVIII Conferencia de la Asociación Española para la Inteligencia Artificial, Granada, España, pp. 551–556, October 2018

    Google Scholar 

  27. Gil-Borrás, S., Pardo, E.G., Alonso-Ayuso, A., Duarte, A.: New VNS variants for the online order batching problem. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds.) ICVNS 2018. LNCS, vol. 11328, pp. 89–100. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-15843-9_8

    Chapter  Google Scholar 

  28. Hall, R.W.: Distance approximations for routing manual pickers in a warehouse. IIE Trans. 25(4), 76–87 (1993)

    Article  Google Scholar 

  29. Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  30. Hansen, P., Mladenović, N., Moreno-Pérez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367–407 (2010). https://doi.org/10.1007/s10479-009-0657-6

    Article  MathSciNet  MATH  Google Scholar 

  31. Hansen, P., Mladenović, N., Todosijević, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423–454 (2017). https://doi.org/10.1007/s13675-016-0075-x

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  34. 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)

    Article  MATH  Google Scholar 

  35. Henn, S.: Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses. Flex. Serv. Manuf. J. 27(1), 86–114 (2015). https://doi.org/10.1007/s10696-012-9164-1

    Article  Google Scholar 

  36. Henn, S., Koch, S., Doerner, K.F., Strauss, C., Wäscher, G.: Metaheuristics for the order batching problem in manual order picking systems. Bus. Res. 3(1), 82–105 (2010)

    Article  Google Scholar 

  37. Henn, S., et al.: Variable neighborhood search for the order batching and sequencing problem with multiple pickers. Technical report, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management (2012)

    Google Scholar 

  38. 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–3417 (2006)

    Article  MATH  Google Scholar 

  39. Ho, Y.C., Su, T.S., Shi, Z.B.: Order-batching methods for an order-picking warehouse with two cross aisles. Comput. Ind. Eng. 55(2), 321–347 (2008)

    Article  Google Scholar 

  40. Hong, S., Johnson, A.L., Peters, B.A.: Analysis of picker blocking in narrow-aisle batch picking. Technical report, Texas A&M University (2010)

    Google Scholar 

  41. Hong, S., Johnson, A.L., Peters, B.A.: Batch picking in narrow-aisle order picking systems with consideration for picker blocking. Eur. J. Oper. Res. 221(3), 557–570 (2012)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  43. Huang, M., Guo, Q., Liu, J., Huang, X.: Mixed model assembly line scheduling approach to order picking problem in online supermarkets. Sustainability 10(11), 3931 (2018)

    Article  Google Scholar 

  44. Jiang, X., Zhou, Y., Zhang, Y., Sun, L., Hu, X.: Order batching and sequencing problem under the pick-and-sort strategy in online supermarkets. Procedia Comput. Sci. 126, 1985–1993 (2018)

    Article  Google Scholar 

  45. Kamin, N.: On-line optimization of order picking in an automated warehouse. Ph.D. thesis, Technische Universität Belin, Belin, Germany (1998)

    Google Scholar 

  46. Koch, S., Wäscher, G.: A grouping genetic algorithm for the Order Batching Problem in distribution warehouses. J. Bus. Econ. 86(1–2), 131–153 (2016). https://doi.org/10.1007/s11573-015-0789-x

    Article  Google Scholar 

  47. Koster, R.D., Poort, E.V.D.: Routing orderpickers in a warehouse: a comparison between optimal and heuristic solutions. IIE Trans. 30(5), 469–480 (1998)

    Article  Google Scholar 

  48. Le-Duc, T.: Design and control of efficient order picking processes. Ph.D. thesis, Erasmus University Rotterdam. Erasmus Research Institute of Management, Rotterdam, Holland, September 2005

    Google Scholar 

  49. Lenoble, N., Frein, Y., Hammami, R.: Optimization of order batching in a picking system with a vertical lift module. In: Temponi, C., Vandaele, N. (eds.) ILS 2016. LNBIP, vol. 262, pp. 153–167. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73758-4_11

    Chapter  MATH  Google Scholar 

  50. Lenoble, N., Frein, Y., Hammami, R.: Optimization of order batching in a picking system with carousels. In: 20th World Congress of the International Federation of Automatic Control, IFAC 2017 (2017)

    Google Scholar 

  51. Lin, C.C., Kang, J.R., Hou, C.C., Cheng, C.Y.: Joint order batching and picker manhattan routing problem. Comput. Ind. Eng. 95, 164–174 (2016)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  53. Menéndez, B., Pardo, E.G., Alonso-Ayuso, A., Molina, E., Duarte, A.: Variable neighborhood search strategies for the order batching problem. Comput. Oper. Res. 78, 500–512 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  54. Menéndez, B., Pardo, E.G., Duarte, A., Alonso-Ayuso, A., Molina, E.: General variable neighborhood search applied to the picking process in a warehouse. Electron. Notes Discrete Math. 47, 77–84 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  55. Menéndez, B., Pardo, E.G., Sánchez-Oro, J., Duarte, A.: Parallel variable neighborhood search for the min-max order batching problem. Int. Trans. Oper. Res. 24(3), 635–662 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  56. Menéndez, B., Pardo, E.G., Duarte, A.: Búsqueda de vecindad variable general aplicada al proceso de recogida de productos en almacenes. In: XVI Conferencia de la Asociación Española para la Inteligencia Artificial, Albacete, España, Noviembre 2015

    Google Scholar 

  57. Miguel, F., Frutos, M., Tohmé, F., Rossit, D.: A memetic algorithm for the integral obp/opp problem in a logistics distribution center. Uncertain Supply Chain. Manag. 7(2), 203–214 (2019)

    Article  Google Scholar 

  58. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  59. Öncan, T.: MILP formulations and an iterated local search algorithm with Tabu thresholding for the order batching problem. Eur. J. Oper. Res. 243(1), 142–155 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  60. Öncan, T., Cağırıcı, M.: MILP formulations for the order batching problem in low-level picker-to-part warehouse systems. IFAC Proc. Vol. 46(9), 471–476 (2013)

    Article  Google Scholar 

  61. Oncan, T.: A genetic algorithm for the order batching problem in low-level picker-to-part warehouse systems. In: Proceedings of the International MultiConference of Engineers and Computer Scientists, vol. 1 (2013)

    Google Scholar 

  62. Pan, C.H., Liu, S.Y.: A comparative study of order batching algorithms. Omega 23(6), 691–700 (1995)

    Article  Google Scholar 

  63. Pan, J.C.H., Shih, P.H., Wu, M.H.: Order batching in a pick-and-pass warehousing system with group genetic algorithm. Omega 57, 238–248 (2015)

    Article  Google Scholar 

  64. Pardo, E.G., Mladenović, N., Pantrigo, J.J., Duarte, A.: Variable formulation search for the cutwidth minimization problem. Appl. Soft Comput. 13(5), 2242–2252 (2013)

    Article  MATH  Google Scholar 

  65. Parikh, P.J.: Designing order picking systems for distribution centers. Ph.D. thesis, Virginia Tech. Faculty of the Virginia Polytechnic Institute and State University, Blacksburg, Virginia, USA (2006)

    Google Scholar 

  66. Pérez-Rodríguez, R., Hernández-Aguirre, A., Jöns, S.: A continuous estimation of distribution algorithm for the online order-batching problem. Int. J. Adv. Manuf. Technol. 79(1), 569–588 (2015). https://doi.org/10.1007/s00170-015-6835-6

    Article  Google Scholar 

  67. Pérez-Rodríguez, R., Hernández-Aguirre, A.: An estimation of distribution algorithm-based approach for the order batching problem. Res. Comput. Sci. 93, 141–150 (2015)

    Article  Google Scholar 

  68. Pérez-Rodríguez, R., Hernández-Aguirre, A.: An estimation of distribution algorithm-based approach for the order batching problem: an experimental study. In: Handbook of Research on Military, Aeronautical, and Maritime Logistics and Operations, pp. 509–518. IGI Global (2016)

    Google Scholar 

  69. Pérez-Rodríguez, R., Hernández-Aguirre, A.: Finding interactions or relationships between customer orders for building better batches by means of an estimation of distribution algorithm-based approach for the online order batching problem. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 989–996. ACM (2016)

    Google Scholar 

  70. Petersen, C.G.: An evaluation of order picking routeing policies. Int. J. Oper. Prod. Manag. 17(11), 1098–1111 (1997)

    Article  Google Scholar 

  71. Petersen, C.: Routeing and storage policy interaction in order picking operations. Decis. Sci. Inst. Proc. 31(3), 1614–1616 (1995)

    Google Scholar 

  72. Postema, J.T.: Metaheuristics for order batching in ecommerce warehouses. In: 27th Twente Student Conference on IT. University of Twente, Faculty of Electrical Engineering, Mathematics and Computer Science, Enschede, The Netherlands, July 2017

    Google Scholar 

  73. Raj, L.S., Girubha, R.J.: Aggregation of order picking system using order batching. IOSR J. Mech. Civ. Eng. 11(2), 01–04 (2014)

    Article  Google Scholar 

  74. Ratliff, H.D., Rosenthal, A.S.: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper. Res. 31(3), 507–521 (1983)

    Article  MATH  Google Scholar 

  75. Roodbergen, K.J., Petersen, C.G.: How to improve order picking efficiency with routing and storage policies. In: Progress in Material Handling Practice, pp. 107–124 (1999)

    Google Scholar 

  76. Rosenwein, M.B.: A comparison of heuristics for the problem of batching orders for warehouse selection. Int. J. Prod. Res. 34(3), 657–664 (1996)

    Article  MATH  Google Scholar 

  77. Rubrico, J., Higashi, T., Tamura, H., Ota, J.: Online rescheduling of multiple picking agents for warehouse management. Robot. Comput. Integr. Manuf. 27(1), 62–71 (2011)

    Article  Google Scholar 

  78. Scholz, A., Wäscher, G.: Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing. Cent. Eur. J. Oper. Res. 25(2), 491–520 (2017). https://doi.org/10.1007/s10100-017-0467-x

    Article  MathSciNet  MATH  Google Scholar 

  79. 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)

    Article  MathSciNet  MATH  Google Scholar 

  80. Schubert, D., Scholz, A., Wäscher, G.: Integrated order picking and vehicle routing with due dates. OR Spectr. 40(4), 1109–1139 (2018). https://doi.org/10.1007/s00291-018-0517-3

    Article  MathSciNet  Google Scholar 

  81. Tang, L.C., Chew, E.P.: Order picking systems: batching and storage assignment strategies. Comput. Ind. Eng. 33(3), 817–820 (1997). Selected Papers from the Proceedings of 1996 ICC&IC

    Article  Google Scholar 

  82. 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)

    Article  MATH  Google Scholar 

  83. Valle, C.A., Beasley, J.E., da Cunha, A.S.: Optimally solving the joint order batching and picker routing problem. Eur. J. Oper. Res. 262(3), 817–834 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  84. Valle, C.A., Beasley, J.E.: Order batching for picker routing using a distance approximation. arXiv preprint arXiv:1808.00499 (2018)

  85. Van Gils, T., Braekers, K., Ramaekers, K., Depaire, B., Caris, A.: Improving order picking efficiency by analyzing the combination of storage, batching, zoning and routing policies in a 2-block warehouse. Technical report, Hasselt University, Martelarenlaan 42, 3500 Hasselt, Belgium (2016)

    Google Scholar 

  86. Van Nieuwenhuyse, I., de Koster, R., Colpaert, J.: Order batching in multi-server pick-and-sort warehouses. Katholieke Universiteit Leuven, Department of Decision Sciences and Information Management, vol. 180, no. 140, pp. 367–8869 (2007)

    Google Scholar 

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

    Article  Google Scholar 

  88. Verschure, A.: Improving picking efficiency in a warehouse with multiple floors at Docdata NV. Ph.D. thesis, Technische Universities Eindhoven, Eindhoven, Netherlands (2014)

    Google Scholar 

  89. Wäscher, G., Scholz, A., et al.: A solution approach for the joint order batching and picker routing problem in a two-block layout. Technical report, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management (2015)

    Google Scholar 

  90. Wasusri, T., Theerawongsathon, P.: An application of discrete event simulation on order picking strategies: A case study of footwear warehouses. In: Claus, T., Frank Herrmann, M.M.O.R. (eds.) Proceedings 30th European Conference on Modelling and Simulation - ECMS, pp. 121–127 (2016)

    Google Scholar 

  91. Won, J., Olafsson, S.: Joint order batching and order picking in warehouse operations. Int. J. Prod. Res. 43(7), 1427–1442 (2005)

    Article  MATH  Google Scholar 

  92. Won, J.: Order batching and picking optimization in terms of supply chain management. Ph.D. thesis, Iowa State University, Iowa, USA (2004)

    Google Scholar 

  93. Yu, M.M.: Enhancing warehouse performance by efficient order picking. Ph.D. thesis, Erasmus University Rotterdam. Erasmus Research Institute of Management, Rotterdam, Holland (2008)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  97. Zhu, J., Zhang, H., Zhou, L., Guo, J.: Order batching optimization in dual zone type warehouse based on genetic algorithms. Sci. J. Bus. Manag. 3(3), 77–81 (2015)

    Article  Google Scholar 

  98. Žulj, I., Kramer, S., Schneider, M.: A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. Eur. J. Oper. Res. 264(2), 653–664 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  99. Zuniga, C., Olivares-Benitez, E., Tenahua, A., Mujica, M.: A methodology to solve the order batching problem. IFAC-PapersOnLine 48(3), 1380–1386 (2015)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Sistemas Informáticos, Universidad Politécnica de Madrid, Madrid, Spain

    Sergio Gil-Borrás

  2. Department of Computer Science, Universidad Rey Juan Carlos, Móstoles, Spain

    Eduardo G. Pardo, Antonio Alonso-Ayuso & Abraham Duarte

Authors
  1. Sergio Gil-Borrás
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eduardo G. Pardo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio Alonso-Ayuso
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abraham Duarte
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Sergio Gil-Borrás or Eduardo G. Pardo .

Editor information

Editors and Affiliations

  1. Institut National de Statistique et d'Economie Appliquée (INSEA), Rabat, Morocco

    Rachid Benmansour

  2. University of Macedonia, Thessaloniki, Greece

    Angelo Sifaleras

  3. Khalifa University, Abu Dhabi, United Arab Emirates

    Nenad Mladenović

A Best-Known Values per Instance

A Best-Known Values per Instance

See Table 7.

Table 7. Best-known values of the objective function Time (s) per instance.
Full size table

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gil-Borrás, S., Pardo, E.G., Alonso-Ayuso, A., Duarte, A. (2020). Basic VNS for a Variant of the Online Order Batching Problem. In: Benmansour, R., Sifaleras, A., Mladenović, N. (eds) Variable Neighborhood Search. ICVNS 2019. Lecture Notes in Computer Science(), vol 12010. Springer, Cham. https://doi.org/10.1007/978-3-030-44932-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-44932-2_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-44931-5

  • Online ISBN: 978-3-030-44932-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation