Braess Paradox of traffic networks with mixed equilibrium behaviors

被引:12
|
作者
Wang, Wei [1 ]
Wang, David Z. W. [1 ]
Sun, Huijun [2 ]
Feng, Zengzhe [2 ]
Wu, Jianjun [3 ]
机构
[1] Nanyang Technol Univ, Sch Civil & Environm Engn, Singapore 639798, Singapore
[2] Beijing Jiaotong Univ, Minist Educ, Key Lab Urban Transportat Complex Syst Theory & T, Beijing, Peoples R China
[3] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Braess Paradox; Mixed equilibrium; Braess network; Grid network; STOCHASTIC USER EQUILIBRIUM; ASSIGNMENT MODEL; SYSTEM OPTIMUM; DESIGN PROBLEM; LINK TOLLS; FORMULATION; TIME; MULTICLASS; RELIABILITY; EXISTENCE;
D O I
10.1016/j.tre.2016.05.004
中图分类号
F [经济];
学科分类号
02 ;
摘要
Under the user equilibrium (UE) behavior assumption, the Braess Paradox (BP) and its variations have been well investigated. However, users do not always follow the UE behavior. In reality, there are likely quiet a few non-collaborative Cournot-Nash (CN) players coexisting with UE players in the common traffic network. Users in a CN player are completely collaborative to minimize their total travel cost and users subordinating to different players are perfectly competitive. Considering both UE and CN players in the congested network, it remains unclear that under what conditions the BP will occur. In this paper, the BP occurrence conditions under the UE-CN mixed equilibrium are firstly investigated using the classical Braess network with linear link cost function. Then, the BP conditions are studied to the ordinary grid network with nonlinear link cost function. It is shown that the BP occurrence in the conventional Braess network depends upon the link travel time function parameters and the demand level of users controlled by UE/CN players, and the BP occurs in the grid network only for certain demand combinations of users under one UE player and two CN players. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:95 / 114
页数:20
相关论文
共 50 条
  • [21] Equilibrium with predictive routeing in the online version of the Braess paradox
    Varga, Laszlo Z.
    IET SOFTWARE, 2017, 11 (04) : 165 - 170
  • [22] Resolving Braess's Paradox in Random Networks
    Fotakis, Dimitris
    Kaporis, Alexis C.
    Lianeas, Thanasis
    Spirakis, Paul G.
    ALGORITHMICA, 2017, 78 (03) : 788 - 818
  • [23] Resolving Braess’s Paradox in Random Networks
    Dimitris Fotakis
    Alexis C. Kaporis
    Thanasis Lianeas
    Paul G. Spirakis
    Algorithmica, 2017, 78 : 788 - 818
  • [24] Informational Braess' Paradox: The Effect of Information on Traffic Congestion
    Acemoglu, Daron
    Makhdoumi, Ali
    Malekian, Azarakhsh
    Ozdaglar, Asuman
    OPERATIONS RESEARCH, 2018, 66 (04) : 893 - 917
  • [25] THE BRAESS PARADOX
    FRANK, M
    MATHEMATICAL PROGRAMMING, 1981, 20 (03) : 283 - 302
  • [26] Braess Paradox under the bi-objective user equilibrium
    Zhu, Wenlong
    Zhang, Junting
    Ye, Shunqiang
    Xiang, Wanli
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 213
  • [27] Dynamic Braess's Paradox in Complex Communication Networks
    Xia, Yongxiang
    Hill, David J.
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2013, 60 (03) : 172 - 176
  • [28] Efficiency and Braess' paradox under pricing in general networks
    Huang, X
    Ozdaglar, AE
    Acemoglu, D
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (05) : 977 - 991
  • [29] BRAESS PARADOX AND POWER-LAW NONLINEARITIES IN NETWORKS
    CALVERT, B
    KEADY, G
    JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES B-APPLIED MATHEMATICS, 1993, 35 : 1 - 22
  • [30] Avoiding the Braess paradox in non-cooperative networks
    Korilis, YA
    Lazar, AA
    Orda, A
    JOURNAL OF APPLIED PROBABILITY, 1999, 36 (01) : 211 - 222