全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

The Analysis of Braess’ Paradox and Robustness Based on Dynamic Traffic Assignment Models

DOI: 10.1155/2013/796842

Full-Text   Cite this paper   Add to My Lib

Abstract:

The investigation of the paradox and robustness about the traffic network is an important branch of the traffic assignment. In this paper, Braess’ paradox and robustness of the dynamic traffic network are analyzed by the dynamic traffic assignment models. In addition, the relationship of total costs with different traffic assignment models is discussed. The results show that the paradox only occurs in certain range; the robustness of the network and the relationship of total traffic costs are changed as the traffic demand changes, which provides theoretical guidance for the urban transportation planning. 1. Introduction In recent years, the proposal of the intelligent transportation system (ITS) forces people to investigate the dynamic traffic assignment (DTA). The mathematical programming [1, 2], the optimal control [3, 4], and the variational inequality (VI) [5, 6] were proposed, respectively, and labeled as three main analytical approaches. Specially, the optimal control includes dynamic user equilibrium (DUE) [7–11] and dynamic system optimal (DSO) [12]. Braess’ paradox is an important phenomenon during the traffic assignment [13], which has been widely investigated in the scientific literatures [14–16], such as X. Zhang and H. M. Zhang [17] studied the route choices and a novel paradox in queuing networks; Pas and Principio [18] gained the specific range that the paradox occurs when the link cost only depends on the link flow. Braess’ paradox is rooted in the essence of the user equilibrium (UE) assignment where each user minimizes his/her own travel time between an origin and a destination. The most previous work mainly focuses on the paradox under the static traffic. In recent years, the paradox of the dynamic traffic assignment began to develop, such that Arnott et al. [19] discussed the properties of the dynamic traffic equilibrium including a paradox; Hallefjord et al. [20] analyzed the traffic paradox when the travel demand is elastic; Zhang et al. [21] investigated Braess’ paradox in the dynamic traffic assignment. In this paper, we investigate the paradox phenomenon of the dynamic traffic network using VI method and assuming the link cost at time is related to the flow of this link and the adjacent links at the same paths at time . The robustness, as an important index valuing the stability of the system, is usually used to study the network under the partial degradation. In the process of studying the robustness, it is generally classified into the following two classes according to whether the system structure remains intact: (i) certain

References

[1]  J. R. Birge and J. K. Ho, “Optimal flows in stochastic dynamic networks with congestion,” Operations Research, vol. 41, no. 1, pp. 203–216, 1993.
[2]  B. N. Janson, “Dynamic traffic assignment for urban road networks,” Transportation Research B, vol. 25, no. 2-3, pp. 143–161, 1991.
[3]  B.-W. Wie, T. L. Friesz, and R. L. Tobin, “Dynamic user optimal traffic assignment on congested multidestination networks,” Transportation Research B, vol. 24, no. 6, pp. 431–442, 1990.
[4]  B. Ran, D. E. Boyce, and L. J. LeBlanc, “New class of instantaneous dynamic user-optimal traffic assignment models,” Operations Research, vol. 41, no. 1, pp. 192–202, 1993.
[5]  H.-K. Chen and C.-F. Hsueh, “A model and an algorithm for the dynamic user-optimal route choice problem,” Transportation Research B, vol. 32, no. 3, pp. 219–234, 1998.
[6]  R. Jayakrishnan, W. K. Tsai, and A. Chen, “A dynamic traffic assignment model with traffic-flow relationships,” Transportation Research C, vol. 3, no. 1, pp. 51–72, 1995.
[7]  X. J. Nie, The study of dynamic user-equilibrium traffic assignment [Ph.D. thesis], University of California, Davis, Calif, USA, 2003.
[8]  S. C. Dafermos and F. T. Sparrow, “The traffic assignment problem for a general network,” Journal of Research of the National Bureau of Standards, vol. 73, pp. 91–118, 1969.
[9]  M. J. Smith, “The existence, uniqueness and stability of traffic equilibria,” Transportation Research B, vol. 13, no. 4, pp. 295–304, 1979.
[10]  M. Ng and S. T. Waller, “A dynamic route choice model considering uncertain capacities,” Computer-Aided Civil and Infrastructure Engineering, vol. 27, no. 4, pp. 231–243, 2012.
[11]  Q. Meng and H. L. Khoo, “A computational model for the probit-based dynamic stochastic user optimal traffic assignment problem,” Journal of Advanced Transportation, vol. 46, no. 1, pp. 80–94, 2012.
[12]  S. Dafermos, “Traffic equilibrium and variational inequalities,” Transportation Science, vol. 14, no. 1, pp. 42–54, 1980.
[13]  D. Braess, “über ein paradoxon aus der verkehrsplanung,” Unternehmensforschung, vol. 12, pp. 258–268, 1968.
[14]  S. Dafermos and A. Nagurney, “On some traffic equilibrium theory paradoxes,” Transportation Research B, vol. 18, no. 2, pp. 101–110, 1984.
[15]  T. Akamatsu and B. Heydecker, “Detecting dynamic traffic assignment capacity paradoxes in saturated networks,” Transportation Science, vol. 37, no. 2, pp. 123–138, 2003.
[16]  T. Roughgarden, Selfish Routing and the Price of Anarchy, MIT Press, 2005.
[17]  X. Zhang and H. M. Zhang, “Simultaneous departure time/route choices in queueing networks and a novel paradox,” Networks and Spatial Economics, vol. 10, no. 1, pp. 93–112, 2010.
[18]  E. I. Pas and S. L. Principio, “Braess' paradox: some new insights,” Transportation Research B, vol. 31, no. 3, pp. 265–276, 1997.
[19]  R. Arnott, A. de Palma, and R. Lindsey, “Properties of dynamic traffic equilibrium involving bottlenecks, including a paradox and metering,” Transportation Science, vol. 27, no. 2, pp. 148–160, 1993.
[20]  A. Hallefjord, K. J?rnsten, and S. Stor?y, “Traffic equilibrium paradoxes when travel demand is elastic,” Asia-Pacific Journal of Operational Research, vol. 11, no. 1, pp. 41–50, 1994.
[21]  X. Zhang, W. H. K. Lam, and H.-J. Huang, “Braess's paradoxes in dynamic traffic assignment with simultaneous departure time and route choices,” Transportmetrica, vol. 4, no. 3, pp. 209–225, 2008.
[22]  J. N. Prashker and S. Bekhor, “Some observations on stochastic user equilibrium and system optimum of traffic assignment,” Transportation Research B, vol. 34, no. 4, pp. 277–291, 2000.
[23]  A. Nagurney and Q. Qiang, “A relative total cost index for the evaluation of transportation network robustness in the presence of degradable links and alternative travel behavior,” International Transactions in Operational Research, vol. 16, no. 1, pp. 49–67, 2009.
[24]  A. Nagurney, Q. Qiang, and L. S. Nagurney, “Environmental impact assessment of transportation networks with degradable links in an era of climate change,” International Journal of Sustainable Transportation, vol. 4, no. 3, pp. 154–171, 2010.
[25]  A. Nagurney and Q. Qiang, “A network efficiency measure for congested networks,” Europhysics Letters, vol. 79, no. 3, Article ID 38005, 5 pages, 2007.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133