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 条
  • [1] Braess paradox and robustness of traffic networks under stochastic user equilibrium
    Zhao, Chunxue
    Fu, Baibai
    Wang, Tianming
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2014, 61 : 135 - 141
  • [2] The Braess paradox in mechanical, traffic, and other networks
    Penchina, CM
    Penchina, LJ
    AMERICAN JOURNAL OF PHYSICS, 2003, 71 (05) : 479 - 482
  • [3] Characterizing Braess's Paradox for traffic networks
    Hagstrom, JN
    Abrams, RA
    2001 IEEE INTELLIGENT TRANSPORTATION SYSTEMS - PROCEEDINGS, 2001, : 836 - 841
  • [4] Braess Paradox in Networks of Stochastic Microscopic Traffic Models
    Bittihn, Stefan
    Schadschneider, Andreas
    TRAFFIC AND GRANULAR FLOW '17, 2019, : 45 - 52
  • [5] Analysis and application of Nash equilibrium and Braess' paradox phenomena in traffic network
    Fu, Bai-Bai
    Zhao, Chun-Xue
    Journal of Beijing Institute of Technology (English Edition), 2011, 20 (SUPPL.1): : 168 - 171
  • [6] Braess paradox with mixed strategies
    Haller, Hans
    ECONOMICS BULLETIN, 2023, 43 (01): : 93 - 98
  • [7] The Braess Paradox and Coordination Failure in Directed Networks with Mixed Externalities
    Mak, Vincent
    Seale, Darryl A.
    Gisches, Eyran J.
    Yang, Rui
    Cheng, Meng
    Moon, Myounghee
    Rapoport, Amnon
    PRODUCTION AND OPERATIONS MANAGEMENT, 2018, 27 (04) : 717 - 733
  • [8] The Braess's Paradox in Dynamic Traffic
    Zhuang, Dingyi
    Huang, Yuzhu
    Jayawardana, Vindula
    Zhao, Jinhua
    Suo, Dajiang
    Wu, Cathy
    2022 IEEE 25TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC), 2022, : 1018 - 1023
  • [9] Optimal sub-networks in traffic assignment problem and the Braess paradox
    Askoura, Y.
    Lebacque, J. P.
    Haj-Salem, H.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (02) : 382 - 390
  • [10] Choice of routes in congested traffic networks: Experimental tests of the Braess Paradox
    Rapoport, Amnon
    Kugler, Tamar
    Dugar, Subhasish
    Gisches, Eyran J.
    GAMES AND ECONOMIC BEHAVIOR, 2009, 65 (02) : 538 - 571