检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学交通学院,南京210096
出 处:《东南大学学报(自然科学版)》2008年第5期866-872,共7页Journal of Southeast University:Natural Science Edition
基 金:国家高技术研究发展计划(863计划)资助项目(2007AA11Z202);"十一五"国家科技支撑计划资助项目(2006BAJ18B03);新世纪优秀人才支持计划资助项目(NCET-05-0475);江苏省研究生创新计划资助项目(CX07B-160z)
摘 要:为了确定一般排队网络在高峰时段随时间变化的最优拥挤收费,将描述时变交通流的时空拓展网络(STEN)与传统的网络平衡模型技术相结合,建立了多类型、多模式动态拥挤收费模型.考虑不同类型的出行者有不同的时间价值(VOT),同时,对单车种出行方式进行延拓,建立了包含公交车与私家车在内的多模式交通网络拥挤收费模型,该模型是一个带有路段容量限制下的多类型、多模式网络平衡问题,可以采用内惩罚函数法求解.通过算例分析表明,该模型可以提供动态拥挤收费策略,分析拥挤收费下不同时间价值的用户对于出行方式、出发时间以及出行路径的不同选择,相比于传统的基于瓶颈的静态单模式拥挤收费模型有一定的进步.In order to determine the time-varying optimal pricing at peak-period in a general queuing network, a combined application of the space-time expanded network (STEN) representation of time-varying traffic flow and the conventional network equilibrium modeling techniques is employed in this study. A multi-class and multi-modes traffic network equilibrium model is developed in which travelers of different class may have distinct VOTs ( value of time). Moreover, one mode of transportation network is extended to ones which have the potential to include both buses and private cars. This model is a problem of multi-class and muti-modes network equilibrium with capacity constraints, thus can be solved by the inner penalty function method. The example of numerical analysis shows that this model can provide dynamic congestion pricing strategy, and can analyze how the congestion pricing influences the selection of travel mode, departure time and travel route of travelers with different VOT, and hence makes a significant advance over the conventional static single-mode congestion pricing model based on the bottleneck.
分 类 号:U491.2[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.171.169