Abstract
ABSTRACTMost analyses of accessibility by public transit have focused on travel time and not considered the cost of transit fares. It is difficult to include fares in shortest-path algorithms because fares are often path-dependent. When fare policies allow discounted transfers, for example, the fare for a given journey segment depends on characteristics of previous journey segments. Existing methods to characterize tradeoffs between travel time and monetary cost objectives do not scale well to complex networks, or they rely on approximations. Additionally, they often require assumed values of time, which may be problematic for evaluating the equity of service provision. We propose a new method that allows us to find Pareto sets of paths, jointly minimizing fare and travel time. Using a case study in greater Boston, Massachusetts, USA, we test the algorithm’s performance as part of an interactive web application for computing accessibility metrics. Potential extensions for journey planning and route choice models are also discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Geographical Information Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
