TRANSPORT NETWORK VULNERABILITY ANALYSIS BASED ON TRAFFIC ASSIGNMENT METHODS
Keywords:
transport network vulnerability, traffic assignment, stochastic assignment, user equilibriumAbstract
This paper discusses the possibility of use of two traffic assignment approachesto solve the problem of identification of vulnerable links. The first method is basedon Dial’s algorithm originally used to solve the stochastic traffic assignmentproblem. The second method calculates the costs experienced by all the networkusers according to the user equilibrium assignment (before and after particular linkfailure). This approach is not new but not commonly used because of its highcomputation complexity; this complexity can be considerably reduced usingthe subnetwork approach. There are proposed some new modificationsof the subnetwork approach which could reduce the complexity of the original idea.
Downloads
References
to Reliability Analysis at the Level of National Strategic Transport Networks,
In Proceedings of the 1st International Symposium on Transport Network Reliability,
Oxford (2003).
[2] BERDICA, K., An introduction to road vulnerability: what has been done, is done
and should be done. Transport Policy, 9, (2002).
[3] ERATH, A., BIRDSALL, J., AXHAUSEN, K.W., HAJDIN, R., Vulnerability assessment
Methodology for Swiss Road Network. Transportation Research Record: Journal
of the Transportation Research Board, vol. 2139 (2009).
[4] JENELIUS, E., PETERSEN, T., MATTSSON, L.G., Importance and Exposure in Road
Network Vulnerability Analysis. Transportation Research Part A: Policy and Practice
(2006).
[5] DIAL, R. B., A probabilistic multipath traffic assignment model which obviates the need
for path enumerationm, Transporatation Research, 5 (1971).
[6] PATRIKSSON, M. The Traffic Assignment Problem: Models and Methods. Utrecht: VSP,
(1994).
[7] ERTL, G.: Shortest Path Calculation in Large Road Networks. OR Spectrum, Springer-
Verlag, (1998).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 Miroslav Slivoně
This work is licensed under a Creative Commons Attribution 4.0 International License.
