Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/313825 
Erscheinungsjahr: 
2024
Quellenangabe: 
[Journal:] OR Spectrum [ISSN:] 1436-6304 [Volume:] 46 [Issue:] 2 [Publisher:] Springer [Place:] Berlin, Heidelberg [Year:] 2024 [Pages:] 545-587
Verlag: 
Springer, Berlin, Heidelberg
Zusammenfassung: 
In this paper, we introduce a last-mile delivery concept that is well suited for urban areas. By jointly optimizing the tour of a truck and a cargo bike, we ensure that each vehicle is used optimally. Here, we assume that the bike is restocked by meeting up with the truck so that no dedicated mini-hubs have to be constructed. We model different objective functions and analyze the different variants in comparison to the traveling salesperson problem as well as the capacitated vehicle routing problem. In an experimental evaluation, we compare MIP formulations for different problem variants and assess several heuristic approaches to solve large-scale instances. These results show that we can outperform the truck-only delivery in terms of completion time while reducing the distance driven by the truck.
Schlagwörter: 
Last-mile logistics
Cargo bike
Mixed-integer programming
Two-echelon
Routing
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article
Dokumentversion: 
Published Version

Datei(en):
Datei
Größe





Publikationen in EconStor sind urheberrechtlich geschützt.