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

Full description

Bibliographic Details

Published in:	Algorithms Vol. 13; no. 1; p. 2
Main Authors:	D’Emidio, Mattia, Khan, Imran, Frigioni, Daniele
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.01.2020
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!