期刊文献+

具有线性路阻函数的路径流量分配效率

Traffic Routing Efficiency on Path with Linear Latency Functions
下载PDF
导出
摘要 用户均衡和系统最优是两种最基本的流量分配方式,前者是用户出行时追求费用最小,而不考虑其他用户如何选择路径;后者是对所有用户进行管制,追求网络上总费用最小。针对系统最优时部分路径上费用过大的问题,讨论了路阻函数为线性时,同一路径上两种不同分配方式费用的大小关系;同时,定义了重载路径和轻载路径,并给出两种路径的判别方法。 Two basic traffic routing patterns are user equilibrium and system optimal.Users in former pattern pursuit the path with minimum cost regardless of how other users select the path,and the latter minimizes the total network cost by controlling all users.The excessive costs on some paths with linear latency functions were discussed in the system optimal pattern.The heavy load paths and fractional load paths were defined,and discrimination method of two different paths was given.
作者 武小平
出处 《河南科技大学学报(自然科学版)》 CAS 北大核心 2013年第4期101-104,10,共4页 Journal of Henan University of Science And Technology:Natural Science
基金 陕西省自然科学基金项目(2012JQ9004) 陕西省教育厅人文社科基金项目(12JK0055) 西安邮电学院青年基金面上项目(1040401)
关键词 流量分配 路阻函数 用户均衡 系统最优 traffic routing latency function user equilibrium system optimal
  • 相关文献

参考文献10

  • 1Wardrop J. Some Theoretical Aspects of Rroad Traffic Research[ C ]//Proceedings of the Institute of Civil Engineers. 1952: 325 - 378.
  • 2Beckmann M, McGuire C B, Winsten C B. Studies in the Economics of Transportation [ D ]. New Haven : Yale University Press, 1956.
  • 3Lisa F, Kamal J, Mohammad M. Tolls for Heterogeneous Selfish Users in Muhicommodity Networks and Generalized Congestion Games[Cl//Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. 2004: 277 - 285.
  • 4Roughgarden T. Staekelberg Scheduling Strategies [ C ]//Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing. 2001 : 104 - 113.
  • 5Roughgarden T, Tardos E. How Bad is Selfish Routing [ J ]. Journal of the ACM ,2002 ,49 ( 2 ) : 236 - 259.
  • 6武小平,徐寅峰,苏兵.方格网络上用户均衡行为效率损失研究[J].运筹与管理,2009,18(4):25-30. 被引量:5
  • 7武小平,徐寅峰,方静.方格网络上部分用户可控时流量分配效率[J].系统工程,2012,30(1):104-108. 被引量:1
  • 8Harks T S. Online Multicommodity Routing with Time Windows[ R]. Berlin : Konrad-Zuse-Zentrum fiir Informationstechnik 2007.
  • 9Harks T, Heinz S,Pfetsch M E. Competitive Online Multicommodity Routing[ R ]. Berlin:ZIB Report,2007.
  • 10Harks T, Heinz S, Pfetsch M E. Online Multicommodity Routing Problem [ C ]//Springer Heidelberg. 2007.

二级参考文献15

  • 1王召森.规划道路网密度指标调整之思考[J].城市交通,2004,2(3):46-48. 被引量:38
  • 2黄海军,欧阳恋群,刘天亮.交通网络中用户均衡行为的效率损失上界[J].北京航空航天大学学报,2006,32(10):1215-1219. 被引量:14
  • 3Wardrop J. Some theoretical aspects of road traffic research[C]. In proceedings of the Institute of Civil Engineers, 1952, 1: 325 -378.
  • 4Koutsoupias E, Papadimitriou C. Worst case equilibria[ C]. In proceedings of the 16th Synposium on Theoretical Aspects of Computer Science, LNCS 1563, 1999, 404-413.
  • 5Roughgarden T, Tardos E. How bad is selfish routing[J]. Journal of the ACM Vol. 49, No. 2, March 2002, 236-259.
  • 6Roughgarden T. The price of anarchy is independent of the network topology[ J]. Journal of Computer and System Science 67, 2003. 341-364.
  • 7Roughgarden T, Tardos E. Bounding the inefficiency of equilibria in nonatomic congestion games[ J]. Games and Economic Behavior, 2004, 47: 389-403.
  • 8Chau 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.
  • 9Correa J, Schulz S, Moses S. Selfish routing in capacitated networks[J]. Mathematics of Operations Research, 2004, 29 (4) : 961-976.
  • 10Deng X, Papadimitriou C, Safra S. On the complexity of equilibrium[ J]. Journal of Computer and System Sciences, 2003, 07 (2) : 311-324.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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