Skip to main content
SpringerLink
Log in

A VNS Approach for Batch Sequencing and Route Planning in Manual Picking System with Time Windows

  • 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

In this paper an order picking and route planning problem is studied. The main objective is to minimize the number of pickers involved in collecting the order pool and the total distance covered by the pickers. Since the problem under study is NP-hard, a variable neighborhood search (VNS) is proposed as a heuristic solution approach. Neighborhood is changed according to VNS scheme employing four tailored structures.

Finally, computational tests demonstrate that the proposed VNS algorithm can find good quality solutions for all practical problems examined. The objective values, regarding both the number of pickers employed and the total distance covered by them, are better than the results of genetic algorithm and close to the ones obtained by CPLEX Solver, if it was able to provide a feasible solution.

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

Similar content being viewed by others

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  Google Scholar 

  2. 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(C), 169–183 (2018)

    Article  Google Scholar 

  3. Cergibozan, C., Tasan, A.S.: Order batching operations: an overview of classification, solution techniques. J. Intell. Manuf. 30(1), 335–349 (2019)

    Article  Google Scholar 

  4. Duda, J., Karkula, M.: A hybrid heuristic for order-picking and route planning in warehouses. In: Carpathian Logistics Congress: Logistics, Distribution, Transport & Management CLC 2018, 3 December (2018)

    Google Scholar 

  5. 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 

  6. van Gils, T., Ramaekers, K., Caris, A., de Koster, R.B.M.: Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review. Eur. J. Oper. Res. 267(1), 1–15 (2018)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  8. Henn, S., Koch, S., Wäscher, G.: Order batching in order picking warehouse: a survey of solution approaches. Working paper no. 01/2011, University of Magdeburg (2011)

    Google Scholar 

  9. 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  Google Scholar 

  10. 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, 82–93 (2017)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. Petersen, C.G., Schmenner, R.W.: An evaluation of routing and volume-based storage policies in an order picking operation. Decis. Sci. 30(2), 481–501 (1999)

    Article  Google Scholar 

  13. 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  Google Scholar 

  14. Ž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)

    Google Scholar 

Download references

Acknowledgement

This study was conducted under a research project funded by a statutory grant of the AGH University of Science and Technology in Krakow for maintaining research potential.

Author information

Authors and Affiliations

  1. Department of Applied Computer Science, Faculty of Management, AGH University of Science and Technology, Gramatyka St. 10, 30-067, Krakow, Poland

    Jerzy Duda & Adam Stawowy

Authors
  1. Jerzy Duda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam Stawowy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jerzy Duda .

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ć

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

Duda, J., Stawowy, A. (2020). A VNS Approach for Batch Sequencing and Route Planning in Manual Picking System with Time Windows. 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_12

Download citation

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

  • 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