Simulating individual work trips for transit-facilitated accessibility study

2017 ◽  
Vol 46 (1) ◽  
pp. 84-102 ◽  
Author(s):  
Ruihong Huang

To measure job accessibility, person-based approaches have the advantage to capture all accessibility components: land use, transportation system, individual’s mobility and travel preference, as well as individual’s space and time constraints. This makes person-based approaches more favorable than traditional aggregated approaches in recent years. However, person-based accessibility measures require detailed individual trip data which are very difficult and expensive to acquire, especially at large scales. In addition, traveling by public transportation is a highly time sensitive activity, which can hardly be handled by traditional accessibility measures. This paper presents an agent-based model for simulating individual work trips in hoping to provide an alternative or supplementary solution to person-based accessibility study. In the model, population is simulated as three levels of agents: census tracts, households, and individual workers. And job opportunities (businesses) are simulated as employer agents. Census tract agents have the ability to generate household and worker agents based on their demographic profiles and a road network. Worker agents are the most active agents that can search jobs and find the best paths for commuting. Employer agents can estimate the number of transit-dependent employees, hire workers, and update vacancies. A case study is conducted in the Milwaukee metropolitan area in Wisconsin. Several person-based accessibility measures are computed based on simulated trips, which disclose low accessibility inner city neighborhoods well covered by a transit network.

2021 ◽  
Author(s):  
Oliver Benning ◽  
Jonathan Calles ◽  
Burak Kantarci ◽  
Shahzad Khan

This article presents a practical method for the assessment of the risk profiles of communities by tracking / acquiring, fusing and analyzing data from public transportation, district population distribution, passenger interactions and cross-locality travel data. The proposed framework fuses these data sources into a realistic simulation of a transit network for a given time span. By shedding credible insights into the impact of public transit on pandemic spread, the research findings will help to set the groundwork for tools that could provide pandemic response teams and municipalities with a robust framework for the evaluations of city districts most at risk, and how to adjust municipal services accordingly.


2021 ◽  
Author(s):  
Oliver Benning ◽  
Jonathan Calles ◽  
Burak Kantarci ◽  
Shahzad Khan

This article presents a practical method for the assessment of the risk profiles of communities by tracking / acquiring, fusing and analyzing data from public transportation, district population distribution, passenger interactions and cross-locality travel data. The proposed framework fuses these data sources into a realistic simulation of a transit network for a given time span. By shedding credible insights into the impact of public transit on pandemic spread, the research findings will help to set the groundwork for tools that could provide pandemic response teams and municipalities with a robust framework for the evaluations of city districts most at risk, and how to adjust municipal services accordingly.


2019 ◽  
Vol 1 (1) ◽  
pp. 79-86
Author(s):  
R. Thapa ◽  
J.K. Shrestha

In road networks, it is imperative to discover a shortest way to reach the final destination. When an individual is new to a place, lots of time is wasted in finding the destination. With the advancement of technology, various navigation applications have been developed for guiding private vehicles, but few are designed for public transportation. This study is solely concentrated on finding the possible shortest path in terms of minimum time and cost to reach specific destination for an individual. It requires an appropriate algorithm to search the shortest path. With the implementation of Dijkstra’s algorithm, the shortest path with respect to minimum travel time and travel cost was computed. Public transportation network of Pokhara city was taken for the case study of this research. The results of this analysis indicated that when the “time” impedance was used by the algorithm, it generated the shortest path between the origin and destination along with the path to be followed. This study formulates a framework for generating itinerary for passengers in a transit network that allows the user to find the optimal path with minimum travel time and cost.


2017 ◽  
Vol 9 (2) ◽  
pp. 168781401769228 ◽  
Author(s):  
Hao Wang ◽  
Sida Luo ◽  
Tianming Luo

The fractal characteristics of urban forms and road networks can provide extremely useful information for urban planning. Previous research, however, has hardly acknowledged the fractal nature of transit networks, although this topic is of vital importance given the significance of public transit to city operations. In this study, the fractal characteristics of urban surface transit and road networks were analyzed based on the case study of Strasbourg, France. Two fractal dimensions that are most widely used, the length dimension and branch dimension, were calculated and analyzed using regression and correlation analysis. The results show that surface transit networks are fractal in seven sub-districts of Strasbourg. Furthermore, a relationship was found between the length dimension and branch dimension of road network. The branch dimension of transit network was related not only to the length dimension of transit network but also to the branch dimension of road network. Based on the fractal information, the results suggest possible methods for designing good road and surface transit networks that are well-coupled in urban traffic planning. The implications for urban development are that some potential problems with regard to traffic network structure may exist if current situations are not coincident with some findings in this article.


Sign in / Sign up

Export Citation Format

Share Document