A variable neighborhood search algorithm for a very large-scale practical dial-a-ride problem
Computers & Operations Research · 2026-12 · 196 · 107670
DOI: 10.1016/j.cor.2026.107670 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2026-12. Verfasst von Mohammad Karimi und 2 weiteren Autor:innen. Die Arbeit nennt 42 Literaturangaben. Gefördert von: Natural Sciences and Engineering Research Council of Canada.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Natural Sciences and Engineering Research Council of Canada
Zitieren
APA
Karimi, M., Desaulniers, G., & Gendreau, M. (2026). A variable neighborhood search algorithm for a very large-scale practical dial-a-ride problem. Computers & Operations Research, 196, 107670. https://doi.org/10.1016/j.cor.2026.107670
Vancouver
Karimi M, Desaulniers G, Gendreau M. A variable neighborhood search algorithm for a very large-scale practical dial-a-ride problem. Computers & Operations Research. 2026;196:107670. doi:10.1016/j.cor.2026.107670
BibTeX
@article{Karimi2026,
author = {Karimi, Mohammad and Desaulniers, Guy and Gendreau, Michel},
title = {A variable neighborhood search algorithm for a very large-scale practical dial-a-ride problem},
journal = {Computers & Operations Research},
year = {2026},
volume = {196},
pages = {107670},
doi = {10.1016/j.cor.2026.107670}
}
EUVIMED