Fast and Memory Efficient Multimodal Journey Planning with Delays
Proceedings of the International Symposium on Combinatorial Search · 14.08.2026 · 19 (1) · 93-101
DOI: 10.1609/socs.v19i1.43077 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the International Symposium on Combinatorial Search, online erschienen am 14.08.2026. Verfasst von Denys Katkalo und 2 weiteren Autor:innen.
Abstract (Originalsprache)
State-of-the-art multimodal journey-planning algorithms, such as ULTRA, have recently been adapted to account for delays. In this work, we extend this approach to be more memory-efficient, faster, and accurate. We also adapt this framework to other state-of-the-art algorithms, like CSA and RAPTOR. We demonstrate a speedup of x 1.9 -- 4.2 over existing algorithms in the single-criterion search. In the multicriteria setting, we achieve competitive speedup results but greater accurateness. We also found that our method scales much better as the delay increases.
Zitieren
APA
Katkalo, D., Rohovyi, A., & Walsh, T. (2026). Fast and Memory Efficient Multimodal Journey Planning with Delays. Proceedings of the International Symposium on Combinatorial Search, 19(1), 93-101. https://doi.org/10.1609/socs.v19i1.43077
Vancouver
Katkalo D, Rohovyi A, Walsh T. Fast and Memory Efficient Multimodal Journey Planning with Delays. Proceedings of the International Symposium on Combinatorial Search. 2026;19(1):93-101. doi:10.1609/socs.v19i1.43077
BibTeX
@article{Katkalo2026,
author = {Katkalo, Denys and Rohovyi, Andrii and Walsh, Toby},
title = {Fast and Memory Efficient Multimodal Journey Planning with Delays},
journal = {Proceedings of the International Symposium on Combinatorial Search},
year = {2026},
volume = {19},
number = {1},
pages = {93--101},
doi = {10.1609/socs.v19i1.43077}
}
EUVIMED