交通网络中用户均衡行为的效率损失上界

黄海军; 欧阳恋群; 刘天亮

交通网络中用户均衡行为的效率损失上界

北京航空航天大学经济管理学院, 北京 100083

基金项目: 国家自然科学基金资助项目(70521001)

详细信息

作者简介:
黄海军(1964-),男,湖南望城人,教授, haijunhuang@buaa.edu.cn.

中图分类号: U 491
计量
- 文章访问数: 2752
- HTML全文浏览量: 129
- PDF下载量: 1043
- 被引次数: 0
出版历程
- 收稿日期: 2006-04-17
- 网络出版日期: 2006-10-31

Upper bounds of efficiency loss for user equilibrium behavior in traffic networks

School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing 100083, China

摘要

摘要: 确定交通网络用户均衡行为效率损失的上界是当前国际上的一个研究热点.深入分析了固定需求的交通网络中用户均衡与系统最优之间的关系,通过引入一个与均衡流量相关的参数,得到新用户均衡行为效率损失上界计算公式.算例结果表明,新的上界比目前文献报道的最低值还小.得到一个具有普适性的结论,即发现更小的用户均衡行为效率损失上界须涉及对象网络的所有特征,包括路段阻抗函数的特性、网络结构和交通需求水平.
- 用户均衡 /
- 系统最优 /
- 效率损失上界
Abstract: Determining the upper bounds of efficiency loss for user equilibrium behavior in traffic networks has become a hot topic. The relationship between user equilibrium and system optimum flow patterns was explored in traffic networks with fixed demands. New formulae for computing the upper bounds of efficiency loss caused by user equilibrium behavior were derived through introducing a parameter associated with the user equilibrium flow pattern. Numerical examples show that the new formulae can give lower values of the upper bounds than those reported in literature. It is also concluded that finding more accurate upper bounds has to be connected with all characteristics of the studied networks, including the link cost functions, the network configurations and the travel demands.
- user equilibrium /
- system optimum /
- upper bounds of efficiency loss

HTML全文

参考文献(1)

[1] Roughgarden T, Tardos . How bad is selfish routing[J]. Journal of the ACM, 2002, 49:236-259 [2] Chau C K, Sim K M. The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands [J]. Operations Research Letter, 2003, 31:327-334 [3] Roughgarden T, Tardos . Bounding the inefficiency of equilibria in nonatomic congestion games [J]. Games and Economic Behavior, 2004, 47:389-403 [4] Perakis G. The price of anarchy under nonlinear and asymmetric costs Proceedings of the 10th Conference on Integer Programming and Combinatorial Optimization (Lecture Notes in Computer Science 3064). Berlin:Springer, 2004:46-58 [5] Correa J R, Schulz S A, Stier-Moses N E. Selfish routing in capacitated networks [J]. Mathematics of Operations Research, 2004, 29(4):961-976 [6] Yang H, Huang H J. Mathematical and economic theory of road pricing [M]. Oxford:Elsevier Ltd, 2005:345-388 [7] Correa J R, Schulz A S, Stier-Moses N E. On the inefficiency of equilibria in congestion games Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (Lecture Notes in Computer Science 3509). Berlin:Springer, 2005:167-181 [8] Guo X L, Yang H. The price of anarchy of stochastic user equilibrium in traffic networks Proceedings of the 10th International Conference of HongKong Society for Transportation Studies (HKSTS). Hong Kong:HKSTS Ltd, 2005:63-72 [9] Huang H J, Liu T L, Guo Xiaolei, et al. Efficiency loss of the mixed SUE with ATIS market penetration Proceedings of the Post-Conference Workshop of the 10th HKSTS:Behaviours in Networks. Hong Kong:HKSTS Ltd, 2005:21-32 [10] Koutsoupias E, Papadimitriou C H. Worst-case equilibria Lecture Notes in Computer Science 1563. Berlin:Springer, 1999:404-413 [11] Deng X, Papadimitriou C H, Safra S. On the complexity of equilibrium . Journal of Computer and System Sciences, 2003, 67(2):311-324 [12] Papadimitriou C H, Roughgarden T. Computing equilibria in multi-player games Proceedings of SODA. Berlin:Springer, 2005:82-91 [13] 黄海军. 城市交通网络平衡分析——理论与实践[M]. 北京:人民交通出版社,1994:20-30 Huang Haijun. Urban transportation network equilibrium analysis:theory and practice [M]. Beijing:China Communications Press, 1994:20-30(in Chinese)

施引文献

资源附件(0)

访问统计