Transport Network Vulnerability Analysis Based on Traffic Assignment Methods
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25510%2F10%3A39881958" target="_blank" >RIV/00216275:25510/10:39881958 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Transport Network Vulnerability Analysis Based on Traffic Assignment Methods
Original language description
This paper discusses the possibility of use of two traffic assignment approaches to solve the problem of identification of vulnerable links. The first method is based on Dial's algorithm originally used to solve the stochastic traffic assignment problem.The second method calculates the costs experienced by all the network users according to the user equilibrium assignment (before and after particular link failure). This approach is not new but not commonly used because of its high computation complexity; this complexity can be considerably reduced using the subnetwork approach. There are proposed some new modifications of the subnetwork approach which could reduce the complexity of the original idea.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JO - Land transport systems and equipment
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Perner's Contacts
ISSN
1801-674X
e-ISSN
—
Volume of the periodical
5
Issue of the periodical within the volume
4
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
7
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—