Abstract
Various methods have been developed to account for travel time variability and uncertainty when analyzing public transport networks and computing related accessibility indicators. In this paper, we establish some convergence characteristics of one such method, implemented in the R5 routing engine, yielding guidelines for the minimum number of randomized schedules. This parameter has implications for result stability, analysis turnaround time, and computation costs. We also confirm that for travel time and accessibility results, there are spatially varying differences between our method and the conventional method relying on the assumption of half-headway waiting times. The conventional method appears to understate the benefits of transit in certain locations, particularly those served by multiple lines. Researchers and planning practitioners may find the R5 method preferable when analyzing complex networks or comparing transit scenarios where routes are specified in terms of headways or frequencies, rather than complete schedules with exact departure times for each trip.
Get full access to this article
View all access options for this article.
References
Supplementary Material
Please find the following supplemental material available below.
For Open Access articles published under a Creative Commons License, all supplemental material carries the same license as the article it is associated with.
For non-Open Access articles published, all supplemental material carries a non-exclusive license, and permission requests for re-use of supplemental material or any part of supplemental material shall be sent directly to the copyright owner as specified in the copyright notice associated with the article.
