Relative Reachability in Transportation Networks

We propose to explore the notion of relative reachability in transportation networks. Relative reachability refers to the determination of which transportation mode is more efficient to reach a given location in a city, e.g., using private vehicles vs. public transit. Within this context, an obvious and admittedly straightforward question (query) is to find the relative reachability of a particular destination. A more interesting and challenging problem though is to compute a city’s relative reachability, which is the main goal of this project. More specifically, given main points of interest such as hospitals, exchange transit centers or schools, our goal is to find their average relative reachability from different locations within a city. The results produced by such query can be explored to answer useful questions within the context of urban planning. TO BE CONT’D

Faculty Supervisor:

Mario Nascimento

Student:

Partner:

Johannes Gutenberg-Universität Mainz

Discipline:

Computer science

Sector:

Education

University:

University of Alberta

Program: