A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses

We consider an optimization problem arising when a set of items must be selected and picked up from given locations in an automated storage and retrieval system by a crane of given capacity, minimizing the overall distance traveled. The problem has been classified as open in a recent taxonomy of opt...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of scheduling Jg. 27; H. 4; S. 393 - 407
Hauptverfasser: Barbato, Michele, Ceselli, Alberto, Righini, Giovanni
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.08.2024
Springer Nature B.V
Schlagworte:
Algorithms
Artificial Intelligence
Automated storage retrieval systems
Automation
Business and Management
Calculus of Variations and Optimal Control; Optimization
Cranes
Dynamic programming
Energy consumption
Operations Research/Decision Theory
Optimization
Picking
Polynomials
Scheduling
Supply Chain Management
Taxonomy
Warehouses
Crane scheduling
Polynomial-time algorithm
Dynamic programming
Combinatorial optimization
ISSN:1094-6136, 1099-1425
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider an optimization problem arising when a set of items must be selected and picked up from given locations in an automated storage and retrieval system by a crane of given capacity, minimizing the overall distance traveled. The problem has been classified as open in a recent taxonomy of optimal picking problems in automated warehouses. In this paper, we analyze some non-trivial properties of the problem and we describe a polynomial-time dynamic programming algorithm to solve it to proven optimality.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-024-00811-2