IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v347y2025i3d10.1007_s10479-025-06481-3.html
   My bibliography  Save this article

A note on the complexity of the picker routing problem in multi-block warehouses and related problems

Author

Listed:
  • Thibault Prunet

    (Mines Saint-Etienne, Univ. Clermont Auvergne, INP Clermont Auvergne, CNRS UMR 6158 LIMOS
    CERMICS, Ecole des Ponts, IP Paris)

  • Nabil Absi

    (Mines Saint-Etienne, Univ. Clermont Auvergne, INP Clermont Auvergne, CNRS UMR 6158 LIMOS
    Mohammed VI Polytechnic University)

  • Diego Cattaruzza

    (University Lille, CNRS, Centrale Lille, Inria, UMR 9189
    University of Udine)

Abstract

The Picker Routing Problem (PRP), which consists of finding a minimum-length tour between a set of storage locations in a warehouse, is one of the most important problems in the warehousing logistics literature. Despite its popularity, the tractability of the PRP in multi-block warehouses remains an open question. This technical note aims to fill this research gap by establishing that the problem is strongly NP-hard. As a corollary, the complexity status of other related problems is settled.

Suggested Citation

  • Thibault Prunet & Nabil Absi & Diego Cattaruzza, 2025. "A note on the complexity of the picker routing problem in multi-block warehouses and related problems," Annals of Operations Research, Springer, vol. 347(3), pages 1595-1605, April.
    • Handle: RePEc:spr:annopr:v:347:y:2025:i:3:d:10.1007_s10479-025-06481-3
    DOI: 10.1007/s10479-025-06481-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06481-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-025-06481-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Masae, Makusee & Glock, Christoph H. & Grosse, Eric H., 2020. "Order picker routing in warehouses: A systematic literature review," International Journal of Production Economics, Elsevier, vol. 224(C).
    2. Ömer Öztürkoğlu & Kevin Gue & Russell Meller, 2012. "Optimal unit-load warehouse designs for single-command operations," IISE Transactions, Taylor & Francis Journals, vol. 44(6), pages 459-475.
    3. de Koster, Rene & Le-Duc, Tho & Roodbergen, Kees Jan, 2007. "Design and control of warehouse order picking: A literature review," European Journal of Operational Research, Elsevier, vol. 182(2), pages 481-501, October.
    4. Laura Lüke & Katrin Heßler & Stefan Irnich, 2024. "The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(3), pages 909-951, September.
    5. Scholz, André & Henn, Sebastian & Stuhlmann, Meike & Wäscher, Gerhard, 2016. "A new mathematical programming formulation for the Single-Picker Routing Problem," European Journal of Operational Research, Elsevier, vol. 253(1), pages 68-84.
    6. Maximilian Schiffer & Nils Boysen & Patrick S. Klein & Gilbert Laporte & Marco Pavone, 2022. "Optimal Picking Policies in E-Commerce Warehouses," Management Science, INFORMS, vol. 68(10), pages 7497-7517, October.
    7. Cambazard, Hadrien & Catusse, Nicolas, 2018. "Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane," European Journal of Operational Research, Elsevier, vol. 270(2), pages 419-429.
    8. H. Donald Ratliff & Arnon S. Rosenthal, 1983. "Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem," Operations Research, INFORMS, vol. 31(3), pages 507-521, June.
    9. Briant, Olivier & Cambazard, Hadrien & Cattaruzza, Diego & Catusse, Nicolas & Ladier, Anne-Laure & Ogier, Maxime, 2020. "An efficient and general approach for the joint order batching and picker routing problem," European Journal of Operational Research, Elsevier, vol. 285(2), pages 497-512.
    10. Makusee Masae & Christoph H. Glock & Panupong Vichitkunakorn, 2020. "Optimal order picker routing in the chevron warehouse," IISE Transactions, Taylor & Francis Journals, vol. 52(6), pages 665-687, June.
    11. Roodbergen, Kees Jan & de Koster, Rene, 2001. "Routing order pickers in a warehouse with a middle aisle," European Journal of Operational Research, Elsevier, vol. 133(1), pages 32-43, August.
    12. van Gils, Teun & Ramaekers, Katrien & Caris, An & de Koster, René B.M., 2018. "Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review," European Journal of Operational Research, Elsevier, vol. 267(1), pages 1-15.
    13. Weidinger, Felix, 2018. "Picker routing in rectangular mixed shelves warehouses," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 126186, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    14. Melih Çelik & Haldun Süral, 2019. "Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic," International Journal of Production Research, Taylor & Francis Journals, vol. 57(3), pages 888-906, February.
    15. Masae, M. & Glock, C. H. & Vichitkunakorn, P., 2021. "A method for efficiently routing order pickers in the leaf warehouse," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 125847, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    16. Masae, Makusee & Glock, Christoph H. & Vichitkunakorn, Panupong, 2021. "A method for efficiently routing order pickers in the leaf warehouse," International Journal of Production Economics, Elsevier, vol. 234(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Saylam, Serhat & Çelik, Melih & Süral, Haldun, 2024. "Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses," European Journal of Operational Research, Elsevier, vol. 313(1), pages 225-240.
    2. Bock, Stefan & Bomsdorf, Stefan & Boysen, Nils & Schneider, Michael, 2025. "A survey on the Traveling Salesman Problem and its variants in a warehousing context," European Journal of Operational Research, Elsevier, vol. 322(1), pages 1-14.
    3. Çelik, Melih & Archetti, Claudia & Süral, Haldun, 2022. "Inventory routing in a warehouse: The storage replenishment routing problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1117-1132.
    4. Boysen, Nils & de Koster, René, 2025. "50 years of warehousing research—An operations research perspective," European Journal of Operational Research, Elsevier, vol. 320(3), pages 449-464.
    5. Mustapha Haouassi & Yannick Kergosien & Jorge E. Mendoza & Louis-Martin Rousseau, 2022. "The integrated orderline batching, batch scheduling, and picker routing problem with multiple pickers: the benefits of splitting customer orders," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 614-645, September.
    6. Atashi Khoei, Arsham & Süral, Haldun & Tural, Mustafa Kemal, 2023. "Energy minimizing order picker forklift routing problem," European Journal of Operational Research, Elsevier, vol. 307(2), pages 604-626.
    7. Masae, Makusee & Glock, Christoph H. & Vichitkunakorn, Panupong, 2021. "A method for efficiently routing order pickers in the leaf warehouse," International Journal of Production Economics, Elsevier, vol. 234(C).
    8. Heiko Diefenbach & Simon Emde & Christoph H. Glock & Eric H. Grosse, 2022. "New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 535-573, June.
    9. Laura Korbacher & Katrin Heßler & Stefan Irnich, 2023. "The Single Picker Routing Problem with Scattered Storage: Modeling and Evaluation of Routing and Storage Policies," Working Papers 2302, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    10. Arbex Valle, Cristiano & Beasley, John E, 2020. "Order batching using an approximation for the distance travelled by pickers," European Journal of Operational Research, Elsevier, vol. 284(2), pages 460-484.
    11. Bock, Stefan & Boysen, Nils, 2025. "Due date-oriented picker routing, an efficient exact solution algorithm, and its application to pick-from-store omnichannel retailing," European Journal of Operational Research, Elsevier, vol. 321(3), pages 775-788.
    12. Katrin Heßler & Stefan Irnich, 2023. "Exact Solution of the Single Picker Routing Problem with Scattered Storage," Working Papers 2303, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    13. Diefenbach, Heiko & Grosse, Eric H. & Glock, Christoph H., 2024. "Human-and-cost-centric storage assignment optimization in picker-to-parts warehouses," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1049-1068.
    14. Constantin Wildt & Felix Weidinger & Nils Boysen, 2025. "Picker routing in scattered storage warehouses: an evaluation of solution methods based on TSP transformations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(1), pages 35-66, March.
    15. Laura Lüke & Katrin Heßler & Stefan Irnich, 2024. "The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(3), pages 909-951, September.
    16. Neves-Moreira, Fábio & Amorim, Pedro, 2024. "Learning efficient in-store picking strategies to reduce customer encounters in omnichannel retail," International Journal of Production Economics, Elsevier, vol. 267(C).
    17. Boysen, Nils & de Koster, René & Füßler, David, 2021. "The forgotten sons: Warehousing systems for brick-and-mortar retail chains," European Journal of Operational Research, Elsevier, vol. 288(2), pages 361-381.
    18. Katrin Heßler & Stefan Irnich, 2024. "Exact Solution of the Single-Picker Routing Problem with Scattered Storage," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1417-1435, December.
    19. Giacomo Lanza & Mauro Passacantando & Maria Grazia Scutellà, 2023. "Sequencing and routing in a large warehouse with high degree of product rotation," Flexible Services and Manufacturing Journal, Springer, vol. 35(4), pages 1206-1255, December.
    20. Li Zhou & Huwei Liu & Junhui Zhao & Fan Wang & Jianglong Yang, 2022. "Performance Analysis of Picking Routing Strategies in the Leaf Layout Warehouse," Mathematics, MDPI, vol. 10(17), pages 1-28, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:347:y:2025:i:3:d:10.1007_s10479-025-06481-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.