A data-driven heuristic for the dynamic vehicle routing problem with multiple soft time windows
Computers & Operations Research · 2026-03 · 187 · 107341
DOI: 10.1016/j.cor.2025.107341 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2026-03. Verfasst von Slim Belhaiza und 1 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 61 Literaturangaben. Gefördert von: King Fahd University of Petroleum & Minerals.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- King Fahd University of Petroleum & Minerals
Zitieren
APA
Belhaiza, S., & Laporte, G. (2026). A data-driven heuristic for the dynamic vehicle routing problem with multiple soft time windows. Computers & Operations Research, 187, 107341. https://doi.org/10.1016/j.cor.2025.107341
Vancouver
Belhaiza S, Laporte G. A data-driven heuristic for the dynamic vehicle routing problem with multiple soft time windows. Computers & Operations Research. 2026;187:107341. doi:10.1016/j.cor.2025.107341
BibTeX
@article{Belhaiza2026,
author = {Belhaiza, Slim and Laporte, Gilbert},
title = {A data-driven heuristic for the dynamic vehicle routing problem with multiple soft time windows},
journal = {Computers & Operations Research},
year = {2026},
volume = {187},
pages = {107341},
doi = {10.1016/j.cor.2025.107341}
}
EUVIMED