IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v36y2024i6p1417-1435.html
   My bibliography  Save this article

Exact Solution of the Single-Picker Routing Problem with Scattered Storage

Author

Listed:
  • Katrin Heßler

    (Global Data & AI, Schenker AG, D-45128 Essen, Germany)

  • Stefan Irnich

    (Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz, D-55128 Mainz, Germany)

Abstract

We present a new modeling approach for the single-picker routing problem with scattered storage (SPRP-SS) for order picking in warehouses. The SPRP-SS assumes that an article is, in general, stored at more than one pick position. The task is then the simultaneous selection of pick positions for requested articles and the determination of a minimum-length picker tour collecting the articles. It is a classical result of Ratliff and Rosenthal that, for given pick positions, an optimal picker tour is a shortest path in the state space of a dynamic program with a linear number of states and transitions. We extend the state space of Ratliff and Rosenthal to include scattered storage so that every feasible picker tour is still a path. The additional requirement to make consistent decisions regarding articles to collect is not modeled in the state space so that dynamic programming can no longer be used for the solution. Instead, demand covering can be modeled as additional constraints in shortest-path problems. Therefore, we solve the resulting model with a mixed-integer (linear) programming (MIP) solver. The paper shows that this approach is not only convenient and elegant for single-block parallel-aisle warehouse SPRP-SSs but also generalizable: the solution principle can be applied to different warehouse layouts (we present additional results for a two-block parallel-aisle warehouse) and can incorporate further extensions. Computational experiments with other approaches for the SPRP-SS show that the new modeling approach outperforms the available exact algorithms regarding computational speed.

Suggested Citation

  • 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.
  • Handle: RePEc:inm:orijoc:v:36:y:2024:i:6:p:1417-1435
    DOI: 10.1287/ijoc.2023.0075
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2023.0075
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2023.0075?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
    ---><---

    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:inm:orijoc:v:36:y:2024:i:6:p:1417-1435. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.