Efficiency and vulnerability analysis for congested networks with random data (Q725887)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficiency and vulnerability analysis for congested networks with random data |
scientific article; zbMATH DE number 6912534
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiency and vulnerability analysis for congested networks with random data |
scientific article; zbMATH DE number 6912534 |
Statements
Efficiency and vulnerability analysis for congested networks with random data (English)
0 references
2 August 2018
0 references
In this paper, the theory of vulnerability and efficiency of a congested network and the theory of stochastic variational inequalities are combined. As a result, a model is proposed that describes the performance and vulnerability of a congested network with random traffic demands and where the travel time can be affected by uncertainty. As an application, the famous Braess' network is investigated in detail.
0 references
transportation networks
0 references
network efficiency
0 references
Braess' paradox
0 references
stochastic variational inequalities
0 references
0 references
0 references
