首页 | 本学科首页   官方微博 | 高级检索  
     检索      

???н???????????????????????????????о?
引用本文:吴建军,高自友,孙会君.???н???????????????????????????????о?[J].交通运输系统工程与信息,2008,8(2):69-74.
作者姓名:吴建军  高自友  孙会君
作者单位:?????????? ?????????????????????????????? 100044?? ; ?????????? ??????????????? 100044
基金项目:国家重点基础研究发展计划(973计划) , 国家自然科学基金 , 全国高等学校优秀博士学位论文作者专项基金
摘    要:结合复杂网络理论与城市交通网络配流方法,研究了不同网络拓扑与个体出行行为在城市交通网络上的相关动力学行为。发现对于不同的城市交通网络拓扑,用户均衡效率损失不仅是有界的,而且是有序的。进一步研究表明,无论是用户均衡还是系统最优,最小支撑树上的流量占系统总流量的比值接近一常数,且交通阻塞与流量之间存在某种共同的幂律关系。

关 键 词:???????????  ??С?????  ?????  ????????  
文章编号:1009-6744(2008)02-0069-06
收稿时间:2007-10-16
修稿时间:2007年10月16

Statistical Properties of Individual Choice Behaviors on Urban Traffic Networks
WU Jian-jun,GAO Zi-you,SUN Hui-jun.Statistical Properties of Individual Choice Behaviors on Urban Traffic Networks[J].Transportation Systems Engineering and Information,2008,8(2):69-74.
Authors:WU Jian-jun  GAO Zi-you  SUN Hui-jun
Institution:1.State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University ,Beijing 100044, China;2.School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Abstract:Many transportation processes and behaviors, from traffic flow movement to crowd stampede and natural fluxion, are related to the action of agents. We have investigated and quantified the interplay between topologies and the individual behavior modes (unselfish and selfish) in equilibrium urban traffic networks. In this paper, the unselfish and selfish behavior correspond to the system optimal (SO) and user equilibrium (UE) in the traffic assignment. A significant finding is that the fractions of flow for two cases are constants in the minimum spanning tree where a large number of transport task is shouldered. Additionally, we find that the upper bound of unselfish is limited and ordinal for different network topologies which, therefore, indicates large investment on SO is not an effective method to alleviate the traffic congestion caused by selfish behavior. Surprisingly, we report the phase transition from free traffic to congestion and derive a general scaling relationship between the congestion and the flow in arbitrary network topologies suggesting that the result may be practically useful for designing urban traffic networks.
Keywords:traffic flow assignment  minimum spanning tree  dynamics  complex networks
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《交通运输系统工程与信息》浏览原始摘要信息
点击此处可从《交通运输系统工程与信息》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号