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

New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot

Author

Listed:
  • Diefenbach, Heiko
  • Emde, Simon
  • Glock, Christoph H.
  • Grosse, Eric H.

Abstract

This paper develops new solution procedures for the order picker routing problem in U-shaped order picking zones with a movable depot, which has so far only been solved using simple heuristics. The paper presents the first exact solution approach, based on combinatorial Benders decomposition, as well as a heuristic approach based on dynamic programming that extends the idea of the venerable sweep algorithm. In a computational study, we demonstrate that the exact approach can solve small instances well, while the heuristic dynamic programming approach is fast and exhibits an average optimality gap close to zero in all test instances. Moreover, we investigate the influence of various storage assignment policies from the literature and compare them to a newly derived policy that is shown to be advantageous under certain circumstances. Secondly, we investigate the effects of having a movable depot compared to a fixed one and the influence of the effort to move the depot.

Suggested Citation

  • Diefenbach, Heiko & Emde, Simon & Glock, Christoph H. & Grosse, Eric H., 2024. "New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 143907, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    • Handle: RePEc:dar:wpaper:143907
    DOI: 10.1007/s00291-021-00663-8
    Note: for complete metadata visit http://tubiblio.ulb.tu-darmstadt.de/143907/
    as

    Download full text from publisher

    File URL: https://tuprints.ulb.tu-darmstadt.de/23463
    Download Restriction: no
    File URL: https://doi.org/10.1007/s00291-021-00663-8
    Download Restriction: no
    File URL: https://libkey.io/10.1007/s00291-021-00663-8?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
    ---><---

    References listed on IDEAS

    as
    1. 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).
    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. 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.
    2. 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.
    3. 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.
    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.

    More about this item

    Statistics

    Access and download statistics

    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:dar:wpaper:143907. 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: Dekanatssekretariat (email available below). General contact details of provider: https://edirc.repec.org/data/ivthdde.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.