原文传递
Link Restriction: Methods of Testing and Avoiding Braess Paradox in Networks Considering Traffic Demands
| 题名： | Link Restriction: Methods of Testing and Avoiding Braess Paradox in Networks Considering Traffic Demands |
| 其他题名： | Akamatsu,T.,and Heydecker,B.(2003)."Detecting dynamic traffic assignment capacity paradoxes in saturated networks."Transp.Sci.,37(2),123-138. |
| 正文语种： | 英文 |
| 作者： | Jie Ma |
| 关键词： | Bilevel;Mixed-integer programming;Nonlinear programming;User equilibrium;Bureau of Public Road (BPR) function;Path flows;Link flows;Multiple origination-destination (OD) pairs |
| 摘要： | Braess paradox is a well-known paradox in transportation researches. In urban cities, there are many different kinds of complex road networks. Unavoidably, some of them fall into the Braess paradox and it is hardly realized. In this paper, two proposed approaches are applied to find and avoid the Braess paradox in urban road networks. With the first approach, the links that cause the Braess paradox in the urban road networks with the current origination-destination (OD) matrix can be tested. The other approach is to calculate the range of the OD flows that makes these links fall into the Braess paradox. Unlike other approaches proposed in literature, this proposed approach can figure out the range of traffic demands in the networks with multiple OD pairs. Moreover, by applying these two approaches, the authors design a traffic management called link restriction which can easily figure out which link should be closed down temporarily and when to resume operation to reduce the total travel times of networks with flexible managements. |
| 出版年： | 2018 |
| 论文唯一标识： | P-72Y2018V144N02008 |
| 英文栏目名称： | TECHNICAL PAPERS |
| doi： | 10.1061/JTEPBS.0000111 |
| 期刊名称： | Journal of Transportation Engineering |
| 拼音刊名(出版物代码)： | P-72 |
| 卷： | 144 |
| 期： | 02 |
| 页码： | 58-68 |
相关文献
- A restricted path-based ridesharing user equilibrium
- Avoiding traffic congestion
- Estimation of Delay and Surrogate Conflicts in Automated Network Management Using Linear Regression and Multigene Genetic Programming
- A microsimulation based analysis of the price of anarchy in traffic routing: The enhanced Braess network case
- Routing Trains with Consideration of Congestion-Induced Link and Node Delay
- Robust Deep Learning Architecture for Traffic Flow Estimation from a Subset of Link Sensors
检索历史
应用推荐
