IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v324y2025i3p1002-1016.html
   My bibliography  Save this article

Stow & pick: Optimizing combined stowing and picking tours in scattered storage warehouses

Author

Listed:
  • Bock, Stefan
  • Boysen, Nils

Abstract

To streamline order fulfillment, many e-commerce retailers apply scattered storage in their picker-to-parts warehouses. Instead of putting homogeneous unit loads into racks, they break up the pallets and store individual products within mixed shelves. This increases the probability that (somewhere in the vast warehouses) products, ending up jointly on hardly predictable pick lists, can be picked from neighboring shelves. Scattered storage promises a reduction of picker travel but comes at the price of additional stowing effort. Instead of applying separate workforces, stowing and picking can also be combined. This paper provides an exact routing algorithm for a worker with a picking cart who departs from the depot with multiple bins filled with products to stow, switches to picking underway, and returns bins full of picked products to the depot. We identify nine different combined stowing and picking policies. We provide an exact solution procedure based on the branch&bound paradigm for all these policies, based on the parallel-aisle structure of warehouses. If a constant limits the number of relevant regions (i.e., picking aisle subsections between adjacent cross aisles with a storage position to be visited), this algorithm guarantees polynomial runtime. We apply our algorithm to benchmark the gains of the nine combined stowing and picking policies compared to the traditional approach, where stowing and picking are executed by separate workforces. Depending on the selected policy, average gains between 11.8 and 42.0 % arise.

Suggested Citation

  • Bock, Stefan & Boysen, Nils, 2025. "Stow & pick: Optimizing combined stowing and picking tours in scattered storage warehouses," European Journal of Operational Research, Elsevier, vol. 324(3), pages 1002-1016.
  • Handle: RePEc:eee:ejores:v:324:y:2025:i:3:p:1002-1016
    DOI: 10.1016/j.ejor.2025.02.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725001730
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.02.037?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.

    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:eee:ejores:v:324:y:2025:i:3:p:1002-1016. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.