DOI: 10.17587/prin.14.103-109

A Simple Way to Improve Road Safety by Avoiding Dangerous Sections of the Route

A. M. Gershteyn, Postgraduate Student, ArkadyGer@gmail.com A. N. Terekhov, PhD, Professor, a.terekhov@spbu.ru, Saint Petersburg State University, Saint Petersburg, Starii Petergof, 198504, Russian Federation

Corresponding author: Arkady M. Gershteyn, Postgraduate Student, Saint Petersburg State University, Saint Petersburg, Starii Petergof, 198504, Russian Federation E-mail: ArkadyGer@gmail.com

A simple routing algorithm to improve vehicle safety on a road network has been proposed. If the road network is represented by a graph with edges and nodes, it is sufficient to mark edges with highest incidence (top 800) of severe Traffic Accidents (TA) by adding to the attribute of the edge some penalty and the routing algorithm (Dijkstra or Bellman-Ford) will try to avoid these edges automatically. To estimate safety gain, a Relative Risk Ratio RRR = (TAs along route which avoids TA hotspots/TAs along original route) introduced in [1] was used. Computer simulation was performed for Moscow, Russian Federation. It is shown that for the same start and end points of the route, an average RRR gets smaller by 9...31 % depending on original route length. It is also shown that the cost for improving vehicle safety is an increase in the route length (by 6...11 %) and an increase in the number of nodes in the route (by 6...28 %).

Keywords: routing, vehicle traffic, relative risk ratio, Dijkstra algorithm, accident hotspot

pp. 103–109

For citation:
Gershteyn A. M., Terekhov A. N. A Simple Way to Improve Road Safety by Avoiding Dangerous Sections of the Route, Programmnaya Ingeneria, 2023, vol. 14, no. 3, pp. 103—109. DOI: 10.17587/prin.14.103—109 (in Russian).

References:

1. Gershteyn A. M, Terekhov A. N. Routing Algorithm for Vehicles that Avoids Severe Traffic Accident Hotspots on the Road Network (Using the City of Springfield, Massachusetts as a Case Study), Computer tools in education, 2022, no. 2, pp. 5—18 (in Russian).
2. Dijkstra E. W. A note on two problems in connexion with graphs, Numerische Mathematik, 1959, vol. 1, pp. 269—271. DOI: 10.1007/BF01386390.
3. Bellman R. On a Routing Problem, Quarterly of Applied Math­ematics, 1958, vol. 16, no. 1, pp. 87—90. DOI: 10.1090/qam/102435.
4. Galbrun E., Pelechrinis K., Terzi E. Urban navigation be­yond shortest route: The case of safe paths, Information Systems, 2016, vol. 57, pp. 160—171. DOI: 10.1016/j.is.2015.10.005.
5. Boeing G. OSMnx: New Methods for Acquiring, Construct­ing, Analyzing, and Visualizing Complex Street Networks, Com­puters, Environment and Urban Systems, 2017, vol. 65, pp. 126—139. DOI: 10.1016/j.compenvurbsys.2017.05.004.
6. SANET, available at: http://sanet.csis.u-tokyo.ac.jp/