Small and large neighborhood search for the on-demand bus routing problem: A bus stop assignment and transportation problem
Computers & Operations Research · 2026-12 · 196 · 107641
DOI: 10.1016/j.cor.2026.107641 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2026-12. Verfasst von Jorge Mortes und 4 weiteren Autor:innen. Die Arbeit nennt 63 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Mortes, J., Cousineau, M., Lehuédé, F., Mendoza, J. E., & Restrepo, M. I. (2026). Small and large neighborhood search for the on-demand bus routing problem: A bus stop assignment and transportation problem. Computers & Operations Research, 196, 107641. https://doi.org/10.1016/j.cor.2026.107641
Vancouver
Mortes J, Cousineau M, Lehuédé F, Mendoza JE, Restrepo MI. Small and large neighborhood search for the on-demand bus routing problem: A bus stop assignment and transportation problem. Computers & Operations Research. 2026;196:107641. doi:10.1016/j.cor.2026.107641
BibTeX
@article{Mortes2026,
author = {Mortes, Jorge and Cousineau, Martin and Lehuédé, Fabien and Mendoza, Jorge E. and Restrepo, María I.},
title = {Small and large neighborhood search for the on-demand bus routing problem: A bus stop assignment and transportation problem},
journal = {Computers & Operations Research},
year = {2026},
volume = {196},
pages = {107641},
doi = {10.1016/j.cor.2026.107641}
}
EUVIMED