TU Darmstadt / ULB / TUbiblio

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

Diefenbach, Heiko ; Emde, Simon ; Glock, Christoph H. ; Grosse, Eric H. (2022)
New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot.
In: OR Spectrum: Quantitative Approaches in Management, 44 (2)
doi: 10.1007/s00291-021-00663-8
Article, Bibliographie

This is the latest version of this item.

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.

Item Type: Article
Erschienen: 2022
Creators: Diefenbach, Heiko ; Emde, Simon ; Glock, Christoph H. ; Grosse, Eric H.
Type of entry: Bibliographie
Title: New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot
Language: English
Date: June 2022
Place of Publication: Berlin ; Heidelberg ; New York
Publisher: Springer
Journal or Publication Title: OR Spectrum: Quantitative Approaches in Management
Volume of the journal: 44
Issue Number: 2
DOI: 10.1007/s00291-021-00663-8
Corresponding Links:
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.

Uncontrolled Keywords: Order picking, Routing, Storage assignment, U-shaped pick area, Benders decomposition, Dynamic programming
Additional Information:

Special Issue on Multicriteria Optimization in Industry

Classification DDC: 300 Social sciences > 330 Economics
600 Technology, medicine, applied sciences > 650 Management
Divisions: 01 Department of Law and Economics
01 Department of Law and Economics > Betriebswirtschaftliche Fachgebiete
01 Department of Law and Economics > Betriebswirtschaftliche Fachgebiete > Fachgebiet Produktion und Supply Chain Management
Date Deposited: 28 Mar 2024 08:47
Last Modified: 28 Mar 2024 08:47
PPN:
Corresponding Links:
Export:
Suche nach Titel in: TUfind oder in Google

Available Versions of this Item

Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details