期刊文献+

方格网络上用户均衡行为效率损失研究 被引量:5

The Research of Efficiency Loss for User Equilibrium Behavior in Grid Traffic Networks
下载PDF
导出
摘要 针对用户出行时追求费用最短的路径,而不考虑其它用户如何选择路径,在一般网络中导致系统费用较高的问题,从实际出发,本文重点讨论特殊网络-方格网络上纳什均衡流与系统最优流之间的关系,研究了用户均衡行为的效率损失。研究结果表明,在方格网络上,当路阻函数是系数非负的线性函数和二次函数时,用户均衡行为的效率损失分别是0和0.35,而一般网络中用户均衡行为的效率损失分别是1/3和0.626,说明方格网络具有较好传送流量的功能。该研究为道路建设部门进行道路改造和增加新道路设计提供理论依据。 For the problem that users purse the time-shortest path to assign flow ignoring other users' ways of choosing their paths so that the behavior lead to the higher system cost in general network, the relation between user equilibrium flow and system optimization flow is discussed, and the efficiency loss of user equilibrium behavior is analyzed in grid traffic networks in this paper. The efficiency loss in grid traffic networks are and if the cost functions are linear functions and quadratic functions with nonnegative coefficient respectively, which are better than the efficiency loss and in general traffic networks. The research in this paper can give a help in theory aspect to the government in expanding the road network.
出处 《运筹与管理》 CSCD 北大核心 2009年第4期25-30,共6页 Operations Research and Management Science
基金 国家自然科学基金资助项目(70525004 60736027 70121001) 博士点基金资助项目(20050698048)
关键词 流量分配 效率损失 用户均衡 方格网络 traffic routing efficiency loss user equilibrium grid network
  • 相关文献

参考文献14

  • 1Wardrop J. Some theoretical aspects of road traffic research[C]. In proceedings of the Institute of Civil Engineers, 1952, 1: 325 -378.
  • 2Koutsoupias E, Papadimitriou C. Worst case equilibria[ C]. In proceedings of the 16th Synposium on Theoretical Aspects of Computer Science, LNCS 1563, 1999, 404-413.
  • 3Roughgarden T, Tardos E. How bad is selfish routing[J]. Journal of the ACM Vol. 49, No. 2, March 2002, 236-259.
  • 4Roughgarden T. The price of anarchy is independent of the network topology[ J]. Journal of Computer and System Science 67, 2003. 341-364.
  • 5Roughgarden T, Tardos E. Bounding the inefficiency of equilibria in nonatomic congestion games[ J]. Games and Economic Behavior, 2004, 47: 389-403.
  • 6Chau C, Sim K. The p rice of anarchy for nonatomic congestion games with symmetric cost maps and elastic demands[ J]. Operations Research Letter, 2003, 31 : 327-334.
  • 7Correa J, Schulz S, Moses S. Selfish routing in capacitated networks[J]. Mathematics of Operations Research, 2004, 29 (4) : 961-976.
  • 8黄海军,欧阳恋群,刘天亮.交通网络中用户均衡行为的效率损失上界[J].北京航空航天大学学报,2006,32(10):1215-1219. 被引量:14
  • 9Deng X, Papadimitriou C, Safra S. On the complexity of equilibrium[ J]. Journal of Computer and System Sciences, 2003, 07 (2) : 311-324.
  • 10Papadimitriou C, Roughgarden T. Computing equilibria in multi-player games[ C ]. In proceedings of SODA. Berlin: Springer, 2005: 82-91.

二级参考文献43

共引文献78

同被引文献50

引证文献5

二级引证文献56

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部