A matheuristic for the Two-Echelon Multi-Trip Vehicle Routing Problem with mixed pickup and delivery demand and time windows
Transportation Research Part C: Emerging Technologies · 2024-03 · 160 · 104522
DOI: 10.1016/j.trc.2024.104522 ↗Kurz gefasst
Fachartikel in der Zeitschrift Transportation Research Part C: Emerging Technologies, 2024-03. Verfasst von Jonas Lehmann und 1 weiteren Autor:innen. Die Arbeit wurde bisher 75-mal zitiert (Crossref) und nennt 55 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Lehmann, J., & Winkenbach, M. (2024). A matheuristic for the Two-Echelon Multi-Trip Vehicle Routing Problem with mixed pickup and delivery demand and time windows. Transportation Research Part C: Emerging Technologies, 160, 104522. https://doi.org/10.1016/j.trc.2024.104522
Vancouver
Lehmann J, Winkenbach M. A matheuristic for the Two-Echelon Multi-Trip Vehicle Routing Problem with mixed pickup and delivery demand and time windows. Transportation Research Part C: Emerging Technologies. 2024;160:104522. doi:10.1016/j.trc.2024.104522
BibTeX
@article{Lehmann2024,
author = {Lehmann, Jonas and Winkenbach, Matthias},
title = {A matheuristic for the Two-Echelon Multi-Trip Vehicle Routing Problem with mixed pickup and delivery demand and time windows},
journal = {Transportation Research Part C: Emerging Technologies},
year = {2024},
volume = {160},
pages = {104522},
doi = {10.1016/j.trc.2024.104522}
}
EUVIMED