Computational Model Library

Bicycle encounter model (version 1.0.0)

Each agent cycled from home to its destination (e.g., work or study place) and back again. The resolution of time steps was reduced to one second in order to record all encounters. The spatial resolution of the road graph was continuous. Simulations were computed with multiple numbers of cyclist agents per day ranging between 50 and 10,000. The number of simulated trips thus ranged between 100 and 20,000 trips per simulation. Each simulation was run twice, so that in total 24 simulation runs were computed. After each simulation, the following data were recorded for further analysis: (1) a geospatial point dataset of the encounter locations with the attributes ‘time’, and ‘encounter angle’; (2) a geospatial dataset of the road network graph with the attribute ‘number of times traversed’ for each segment; and (3) the spatially aggregated number of actively cycling agents and encounter events with a resolution of 15 min. In a post-processing step, encounter angles were coded as one of the following types: overtaking (0° to 45°), crossing (45° to 135°), and oncoming (135° to 180°). The probability that two cyclists from opposite directions crash on an ordinary road is negligible. Therefore, encounter points between oncoming cyclists were excluded, except for bicycle-only infrastructures. As we exclusively focused on the population at risk we did not consider any further risk factors such as road design, trip purpose, or weather condition.

cycling_final_basemodel_gw4_view_19-00.png

Release Notes

final model related to the publication Wallentin & Loidl (2016)

Version Submitter First published Last modified Status
1.0.0 Gudrun Wallentin Fri Mar 29 19:38:22 2019 Fri Mar 29 19:38:22 2019 Published

Discussion

Download Release
This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.