Journey Planning Algorithms for Massive Delay-Prone Transit Networks

This paper studies the journey planning problem in the context of transit networks. Given the timetable of a schedule-based transportation system (consisting, e.g., of trains, buses, etc.), the problem seeks journeys optimizing some criteria. Specifically, it seeks to answer natural queries such as,...

Celý popis

Podrobná bibliografia

Vydané v:	Algorithms Ročník 13; číslo 1; s. 2
Hlavní autori:	D’Emidio, Mattia, Khan, Imran, Frigioni, Daniele
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.01.2020
Predmet:	Algorithms Delay Graph representations Graphical representations Labeling Planning Public transportation Queries Query processing Run time (computers) Schedules Timetables Transportation networks Transportation planning Transportation systems
ISSN:	1999-4893, 1999-4893
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!