2021/09/28 by Sascha Witt, Witt, Sascha
Computer Science · Social Sciences · #Data Management and Algorithms #Transportation Planning and Optimization #Advanced Database Systems and Queries
paper · pdf · doi:10.48550/arxiv.2109.14143
We study the problem of computing all Pareto-optimal journeys in a public\ntransit network regarding the two criteria of arrival time and number of\ntransfers taken. In recent years, great advances have been made in making\npublic transit network routing more scalable to larger networks. However, most\napproaches are silent on scalability in another dimension: Time. Experimental\nevaluations are often done on slices of timetables spanning a couple of days,\nwhen in reality, the planning horizon is much longer. We introduce an extension\nto trip-based public transit routing, proposed in [12], that allows efficient\nhandling of arbitrarily long timetables. Our experimental evaluation shows that\nthe resulting algorithm achieves fast queries on year-spanning timetables, and\ncan incorporate updates such as delays or changed routes quickly even on large\nnetworks.\n