IDEAS home Printed from https://ideas.repec.org/p/jgu/wpaper/2502.html
   My bibliography  Save this paper

A Linear-Size Model for the Single Picker Routing Problem with Scattered Storage

Author

Listed:
  • Laura Lüke

    (Johannes-Gutenberg University, Germany)

  • André Hessenius

    (Johannes-Gutenberg University, Germany)

  • Stefan Irnich

    (Johannes-Gutenberg University, Germany)

Abstract

We present a new approach of solving the single picker routing problem with scattered storage (SPRP-SS), which is a fundamental problem in modern warehouse operations management. The SPRP-SS assumes that SKUs of articles are stored at possibly many locations. An effective integer programming based approach relies on extending the state space of Ratliff and Rosenthal’s dynamic program for the basic single picker routing problem to accommodate the SPRP-SS. As a result, the mixed integer linear programming (MIP) formulation has a quadratic number of variables. We propose two modifications of the extended state space to retain the linearity of the models. This is achieved by replacing the quadratically growing parallel edges of the extended state space by two different types of linear-size subnetworks. These replacements lead to different state spaces and herewith different MIP formulations, for which we analyze theoretical properties such as their size and strength of the linear relaxations. We compare the new formulations with the state of the art using a collection of 800 SPRP-SS instances. The results show that the new formulations are more than competitive providing integer optimal solutions of realistic and even large-scale instances in less than two seconds on average. The second formulation outperforms the current one regarding the computational speed: For the largest instances with 200 articles to be collected, average speedups reach the factors of 3.18 and 4.87 for general and unit demand, respectively.

Suggested Citation

  • Laura Lüke & André Hessenius & Stefan Irnich, 2025. "A Linear-Size Model for the Single Picker Routing Problem with Scattered Storage," Working Papers 2502, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    • Handle: RePEc:jgu:wpaper:2502
    as

    Download full text from publisher

    File URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_2502.pdf
    File Function: First version, 2025
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Singh, Kashi N. & van Oudheusden, Dirk L., 1997. "A branch and bound algorithm for the traveling purchaser problem," European Journal of Operational Research, Elsevier, vol. 97(3), pages 571-579, March.
    2. Wildt, Constantin & Weidinger, Felix & Boysen, Nils, 2024. "Picker routing in scattered storage warehouses: An evaluation of solution methods based on TSP transformations," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 146724, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    3. 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.
    4. Boysen, Nils & de Koster, René & Weidinger, Felix, 2019. "Warehousing in the e-commerce era: A survey," European Journal of Operational Research, Elsevier, vol. 277(2), pages 396-411.
    5. 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.
    6. 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.
    7. Boysen, Nils & de Koster, René & Weidinger, Felix, 2019. "Warehousing in the e-commerce era: A survey," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 126185, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    8. Daniels, Richard L. & Rummel, Jeffrey L. & Schantz, Robert, 1998. "A model for warehouse order picking," European Journal of Operational Research, Elsevier, vol. 105(1), pages 1-17, February.
    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. 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.
    2. 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.
    3. 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.
    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. Gámez Albán, Harol Mauricio & Cornelissens, Trijntje & Sörensen, Kenneth, 2024. "A new policy for scattered storage assignment to minimize picking travel distances," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1006-1020.
    6. 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.
    7. Su, Yixuan & Zhu, Xi & Yuan, Jinlong & Teo, Kok Lay & Li, Meixia & Li, Chunfa, 2023. "An extensible multi-block layout warehouse routing optimization model," European Journal of Operational Research, Elsevier, vol. 305(1), pages 222-239.
    8. Tutam, Mahmut & De Koster, René, 2024. "To walk or not to walk? Designing intelligent order picking warehouses with collaborative robots," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 190(C).
    9. Žulj, Ivan & Salewski, Hagen & Goeke, Dominik & Schneider, Michael, 2022. "Order batching and batch sequencing in an AMR-assisted picker-to-parts system," European Journal of Operational Research, Elsevier, vol. 298(1), pages 182-201.
    10. Maximilian Löffler & Nils Boysen & Michael Schneider, 2022. "Picker Routing in AGV-Assisted Order Picking Systems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 440-462, January.
    11. Silva, Allyson & Roodbergen, Kees Jan & Coelho, Leandro C. & Darvish, Maryam, 2022. "Estimating optimal ABC zone sizes in manual warehouses," International Journal of Production Economics, Elsevier, vol. 252(C).
    12. Maximilian Löffler & Michael Schneider & Ivan Žulj, 2023. "Cost-neutral reduction of infection risk in picker-to-parts warehousing systems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(1), pages 151-179, March.
    13. Tim Engels & Ivo Adan & Onno Boxma & Jacques Resing, 2024. "An exact analysis and comparison of manual picker routing heuristics," Queueing Systems: Theory and Applications, Springer, vol. 108(3), pages 611-660, December.
    14. Xie, Lin & Li, Hanyi & Luttmann, Laurin, 2023. "Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses," European Journal of Operational Research, Elsevier, vol. 307(2), pages 713-730.
    15. David Füßler & Nils Boysen & Konrad Stephan, 2019. "Trolley line picking: storage assignment and order sequencing to increase picking performance," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 1087-1121, December.
    16. 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.
    17. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    18. Bock, Stefan, 2024. "Vehicle routing for connected service areas - a versatile approach covering single, hierarchical, and bi-criteria objectives," European Journal of Operational Research, Elsevier, vol. 313(3), pages 905-925.
    19. 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.
    20. 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.

    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:jgu:wpaper:2502. 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: Research Unit IPP (email available below). General contact details of provider: https://edirc.repec.org/data/vlmaide.html .

    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.