Identifying critical elements of the road network
Abstract
The aim of the paper is to identify those critical road infrastructure elements, which can be characterized as the most sensitive part of the network especially considering extreme weather conditions or special unexpected external effects. The shortest path method introduced by Dijkstra and the maximum flow algorithm developed by Ford and Fulkerson are applied to investigate the sensitiveness of the network components with regard to unforeseen forthcoming processes for example catastrophes.
References
Arun, A., Velmurugan, S., & Errampalli, M. (2013). Methodological Framework Towards Roadway Capacity Estimation for Indian Multi-lane Highways. Procedia - Social and Behavioral Sciences, 104, 477–486. doi:10.1016/j.sbspro.2013.11.141
Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(l 959), 269–271. doi:10.1007/BF01386390
Greenberg, H. J. (1998). Ford-Fulkerson Max Flow Labeling Algorithm. Mathematical Programming Glossary, 1–5.
Leal, E., Oliveira, D., & Porto, W. (2014). Determining critical links in a road network : vulnerability and congestion indicators. Procedia - Social and Behavioral Sciences, 162(Panam), 158–167. doi:10.1016/j.sbspro.2014.12.196
Luathep, P. (2013). Identification of Critical Locations in Road Networks due to Disasters. Proceedings of the …, 9. Retrieved from http://easts.info/online/proceedings/vol9/PDF/P42.pdf
Sawitzki, D. (2004). Experimental studies of symbolic shortest-path algorithms. Lecture Notes in Computer Science (including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3059(1126), 482–497. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-
&partnerID=40&md5=555820bdd2e58c4e9560bd2e9694b241
Sufyan, N., Saqib, N., & Zia, M. (2013). Detection of jamming attacks in 802.11b wireless networks. EURASIP Journal on Wireless Communications and Networking, 2013, 208. doi:10.1186/1687-1499-2013-208
