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,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithms Jg. 13; H. 1; S. 2
Hauptverfasser:	D’Emidio, Mattia, Khan, Imran, Frigioni, Daniele
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Basel MDPI AG 01.01.2020
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!