Details
| Originalsprache | Englisch |
|---|---|
| Aufsatznummer | 8 |
| Seiten (von - bis) | 1-16 |
| Seitenumfang | 16 |
| Fachzeitschrift | Logistics Research |
| Jahrgang | 13 |
| Ausgabenummer | 1 |
| Frühes Online-Datum | 25 Aug. 2020 |
| Publikationsstatus | Veröffentlicht - Dez. 2020 |
Abstract
We describe a decentralized routing algorithm with physical time windows for modular conveying systems. Existing routing algorithms for modular conveyors are already capable of bi-directional conveying while avoiding conflicts such as collisions, deadlocks, livelocks and starvation effects. In addition to avoiding conflicts, routing algorithms must also select routes that minimize the transport time. No existing algorithm for modular conveyors bases this decision on the expected physical lead time, even though physical lead time directly affects the system throughput. In this publication, we present an algorithm that uses the physical lead time to select routes while avoiding conflicts. The avoidance of conflicts is mathematically proven and the algorithm’s computational complexity is calculated. We present the system behavior of an exemplary layout which consists of nine modular conveying modules that are controlled by our algorithm. With only nine modules, the package throughput is on the same level as the package throughput of conventional sorting systems. Due to its modular design, additional modules can be added to further increase the throughput, thus surpassing the throughput of conventional sorting systems.
ASJC Scopus Sachgebiete
- Ingenieurwesen (insg.)
- Steuerungs- und Systemtechnik
- Betriebswirtschaft, Management und Rechnungswesen (insg.)
- Management-Informationssysteme
- Informatik (insg.)
- Information systems
- Informatik (insg.)
- Angewandte Informatik
- Entscheidungswissenschaften (insg.)
- Managementlehre und Operations Resarch
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Logistics Research, Jahrgang 13, Nr. 1, 8, 12.2020, S. 1-16.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Decentralized Routing Algorithm with Physical Time Windows for Modular Conveyors
AU - Sohrt, Simon
AU - Overmeyer, Ludger
N1 - Funding Information: This publication was done within the scope of the research project “Vernetzte, kognitive Produktionssysteme (netkoPs)”, which was funded by the German Federal Ministry of Education and Research. The authors would like to thank the staff of the Logistics and Distribution Institute (LoDI) at the University of Louisville for their constructive comments on the manuscript.
PY - 2020/12
Y1 - 2020/12
N2 - We describe a decentralized routing algorithm with physical time windows for modular conveying systems. Existing routing algorithms for modular conveyors are already capable of bi-directional conveying while avoiding conflicts such as collisions, deadlocks, livelocks and starvation effects. In addition to avoiding conflicts, routing algorithms must also select routes that minimize the transport time. No existing algorithm for modular conveyors bases this decision on the expected physical lead time, even though physical lead time directly affects the system throughput. In this publication, we present an algorithm that uses the physical lead time to select routes while avoiding conflicts. The avoidance of conflicts is mathematically proven and the algorithm’s computational complexity is calculated. We present the system behavior of an exemplary layout which consists of nine modular conveying modules that are controlled by our algorithm. With only nine modules, the package throughput is on the same level as the package throughput of conventional sorting systems. Due to its modular design, additional modules can be added to further increase the throughput, thus surpassing the throughput of conventional sorting systems.
AB - We describe a decentralized routing algorithm with physical time windows for modular conveying systems. Existing routing algorithms for modular conveyors are already capable of bi-directional conveying while avoiding conflicts such as collisions, deadlocks, livelocks and starvation effects. In addition to avoiding conflicts, routing algorithms must also select routes that minimize the transport time. No existing algorithm for modular conveyors bases this decision on the expected physical lead time, even though physical lead time directly affects the system throughput. In this publication, we present an algorithm that uses the physical lead time to select routes while avoiding conflicts. The avoidance of conflicts is mathematically proven and the algorithm’s computational complexity is calculated. We present the system behavior of an exemplary layout which consists of nine modular conveying modules that are controlled by our algorithm. With only nine modules, the package throughput is on the same level as the package throughput of conventional sorting systems. Due to its modular design, additional modules can be added to further increase the throughput, thus surpassing the throughput of conventional sorting systems.
KW - Bidirectional routing
KW - Conflict-free
KW - Decentralized control
KW - Modular conveyors
KW - Multi-agent system
UR - http://www.scopus.com/inward/record.url?scp=85097815980&partnerID=8YFLogxK
U2 - 10.23773/2020_8
DO - 10.23773/2020_8
M3 - Article
AN - SCOPUS:85097815980
VL - 13
SP - 1
EP - 16
JO - Logistics Research
JF - Logistics Research
SN - 1865-035X
IS - 1
M1 - 8
ER -