Skip to main content

An Adaptive Large Neighborhood Search Heuristic for Jointly Solving Storage Location Assignment and Picker Routing Problem

  • Conference paper
  • First Online:
Operations Research Proceedings 2018

Part of the book series: Operations Research Proceedings ((ORP))

  • 1032 Accesses

Abstract

We focus on the order picking operation carried out in one of the major warehouses of a retailer to satisfy the orders placed by the stores of the same retailer. We investigate the simultaneous solution of the storage assignment problem and picker routing problem referred to as JSAPRP that involves both assigning items to storage locations and deciding on the routes of the pickers for item collection. The performance measure of interest is the minimization of the total traveling distance of the pickers. We develop a mathematical model which can only solve small instances of the JSAPRP. Therefore, we also devise a heuristic method based on adaptive large neighborhood search. Computational results obtained on numerous experiments reveal that the quality of the solutions produced by this heuristic is quite good.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Bindi, F., Manzini, R., Pareschi, A., Regattieri, A.: Similarity-based storage allocation rules in an order picking system: an application to the food service industry. Int. J. Log. Res. Appl. 12(4), 233–247 (2009)

    Article  Google Scholar 

  2. Chiang, D.M.H, Lin, C., Chen, M.: Data mining based storage assignment heuristics for travel distance reduction. Expert Syst. Appl. 31(1), 81–90 (2014)

    Article  Google Scholar 

  3. Frazelle, E.: World-Class Warehousing and Material Handling. McGraw Hill, NewYork (2002)

    Google Scholar 

  4. Frazelle, E., Sharp, G.: Correlated assignment strategy can improve order-picking operation. Ind. Eng. 4, 33–37 (1989)

    Google Scholar 

  5. Goetschalckx, M., Ratliff, H.: Order picking in an aisle. IIE Trans. 20(1), 53–62 (1998)

    Article  Google Scholar 

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

    Article  Google Scholar 

  7. Ratliff, H., Rosenthal, A.: Order picking in a rectangular warehouse: a solveable case of the traveling salesman problem. Oper. Res. 31, 507–521 (1983)

    Article  Google Scholar 

  8. Roodbergen, K.: Layout and routing methods for warehouses. Ph.D. thesis, Rotterdam School of Management, Erasmus University (2001)

    Google Scholar 

  9. Tompkins, J., White, J., Bozer, Y., Frazelle, E., Tanchoco, J.: Facilities Planning. Wiley, Hoboken (2003)

    Google Scholar 

  10. Zhang, Y.: Correlated storage assignment strategy to reduce travel distance in order picking. IFAC-PapersOnLine 49(2), 30–35 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Necati Aras .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Aras, N., Görgülü, B. (2019). An Adaptive Large Neighborhood Search Heuristic for Jointly Solving Storage Location Assignment and Picker Routing Problem. In: Fortz, B., Labbé, M. (eds) Operations Research Proceedings 2018. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-18500-8_38

Download citation

Publish with us

Policies and ethics