Routing Algorithm for Vehicles that Avoids Severe Traffic Accident Hotspots on the Road Network (Using the City of Springfield, Massachusetts as a Case Study)
Abstract
In [1] statistically significant clusters (hotspots) of severe Traffic Accidents (TA) are found. In this article, as a continuation of [1], a simple routing algorithm to avoid TA hotspots on a road network has been proposed («hotspot avoidance» path). If the road network is represented by a graph with edges and nodes, it is enough to mark every edge which lead to the TA hotspot as «not passable» by letting a attribute of the edge be a very large digit, much greater than max edge length for a given road graph — and the routing algorithm (Dijkstra or Bellman-Ford) will avoid the TA hotspot automatically.
Computer simulation was performed for Springfield, MA. It is shown that for the same initial and end points of the route, an average ratio (Route avoiding TA length/Original route length) is bigger for shorter original (without taking into account TA hotspots) routes and gradually slows down to 1.04 for max original route length inside Springfield.
Route length ratios show extra route length needed to avoid TA hotspots, but say nothing about new route safety. To estimate safety gain, a new Relative Risk Ratio RRR= (TAs along route which avoids TA hotspots/TAs along original route) was introduced.
It is shown for Springfield that relatively short (less than 4 km) original routes are more dangerous (have more TAs along the «hotspot avoidance» route) than original ones, but for relatively long (> 4 km) original routes average RRR gets smaller by 16 % while modified path gets longer by 8 % in average.
References
A. M. Gershteyn and A. N. Terekhov, “Hotspots of Traffic Accident sthat cause in juries or death in Massachusetts from 2013 to 2018,” Computer tools in education, no. 1, pp. 45–57, 2021 (in Russian); doi: 10.32603/2071-2340-2021-1-46-58
I. Sahnoon, M. Shawky, and A. Al-Ghafli, “Integrating Traffic Safety in Vehicle Routing Solution,” in Advances in Human Aspects of Transportation. AHFE 2017. Advances in Intelligent Systems and Computing, vol. 597, pp. 251–263, 2018; doi: 10.1007/978-3-319-60441-1_25
A. Graser, M. Straub, and M. Dragaschnig, “Is OSM Good Enough for Vehicle Routing? A Study Comparing Street Networks in Vienna,” in Progress in Location-Based Services 2014, Cham, Germany: Springer, 2014, pp. 3–17; doi: 10.1007/978-3-319-11879-6_1
G. Boeing, “OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks,” Computers, Environment and Urban Systems, vol. 65, pp. 126–139, 2017; doi: 10.1016/j.compenvurbsys.2017.05.004
A. Agresti, Ch. Franklin, and B. Klingenberg, Statistics: The Art and Science of Learning from Data, 4th ed., Harlow, England: Pearson, 2018.
R. D’Agostino, and E. S. Pearson, “Tests for departure from normality. Empirical results for the distributions of 2 and p b 1 ,” Biometrika, vol. 60, no. 3, pp. 613–622, 1973; doi: 10.1093/biomet/60.3.613
E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numer. Math. vol. 1, pp. 269–271, 1959; doi: 10.1007/BF01386390
R. Bellman, “On a Routing Problem,” Quarterly of Applied Mathematics, vol. 16, no. 1. pp. 87–90, 1958; doi: 10.1090/QAM/102435
P. J. Huber and M. E. Ronchetti, “7.7 Concomitant scale estimates,” in Robust Statistics, Hoboken, NJ, U.S.: Wiley, 2009, pp. 172–174.
A. B. Owen, “A Robust Hybrid of Ridge and Lasso and Ridge Regression,” in Statweb.stanford.edu, 2006. [Online]. Available: https://statweb.stanford.edu/~owen/reports/hhu.pdf
R. Koenker and K. F. Hallock, “Quantile Regression,” Journal of Economic Perspectives, vol. 15, no. 4, pp. 143–156, 2001.
This work is licensed under a Creative Commons Attribution 4.0 International License.
