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
Artikel, Bibliographie

Dies ist die neueste Version dieses Eintrags.

Kurzbeschreibung (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.

Typ des Eintrags: Artikel
Erschienen: 2022
Autor(en): Diefenbach, Heiko ; Emde, Simon ; Glock, Christoph H. ; Grosse, Eric H.
Art des Eintrags: Bibliographie
Titel: New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot
Sprache: Englisch
Publikationsjahr: Juni 2022
Ort: Berlin ; Heidelberg ; New York
Verlag: Springer
Titel der Zeitschrift, Zeitung oder Schriftenreihe: OR Spectrum: Quantitative Approaches in Management
Jahrgang/Volume einer Zeitschrift: 44
(Heft-)Nummer: 2
DOI: 10.1007/s00291-021-00663-8
Zugehörige Links:
Kurzbeschreibung (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.

Freie Schlagworte: Order picking, Routing, Storage assignment, U-shaped pick area, Benders decomposition, Dynamic programming
Zusätzliche Informationen:

Special Issue on Multicriteria Optimization in Industry

Sachgruppe der Dewey Dezimalklassifikatin (DDC): 300 Sozialwissenschaften > 330 Wirtschaft
600 Technik, Medizin, angewandte Wissenschaften > 650 Management
Fachbereich(e)/-gebiet(e): 01 Fachbereich Rechts- und Wirtschaftswissenschaften
01 Fachbereich Rechts- und Wirtschaftswissenschaften > Betriebswirtschaftliche Fachgebiete
01 Fachbereich Rechts- und Wirtschaftswissenschaften > Betriebswirtschaftliche Fachgebiete > Fachgebiet Produktion und Supply Chain Management
Hinterlegungsdatum: 28 Mär 2024 08:47
Letzte Änderung: 28 Mär 2024 08:47
PPN:
Export:
Suche nach Titel in: TUfind oder in Google

Verfügbare Versionen dieses Eintrags

Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen