Dr Vadim Zverovich Vadim.Zverovich@uwe.ac.uk
Associate Professor
The likelihood of Braess' paradox in traffic networks
Zverovich, V.
Authors
Abstract
The well-known Braess' paradox illustrates situations when adding a new link to a traffic network might increase congestion in the network. In this article, we announce a number of new results devoted to the probability of Braess' paradox to occur in the classical network configuration, with particular emphasis on the Erlang distribution of parameters of the travel time function. This distribution is important in the context of traffic networks. However, other distributions will be analysed as well because Braess' paradox can be observed in various applied contexts such as telecommunication networks and power transmission networks. Our results revealed that typical probabilities for Braess' paradox to occur in the classical network configuration do not exceed 10%, and they are very low for some distributions of the parameters of travel time functions. If the classical network configuration consists of motorway sections and class A roads and the parameters of the travel time functions are modelled by the Erlang-2 distribution, then the probability of Braess' paradox to occur is 6%.
Citation
Zverovich, V. The likelihood of Braess' paradox in traffic networks. In Modern Applications of Graph Theory. Manuscript submitted for publication
Peer Reviewed | Not Peer Reviewed |
---|---|
Book Title | Modern Applications of Graph Theory |
Keywords | Braess' paradox, probability, equilibrium flow, traffic network |
Public URL | https://uwe-repository.worktribe.com/output/860081 |
You might also like
Methods of Graph Decompositions
(2022)
Book
Modern Applications of Graph Theory
(2021)
Book
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search