带转向延误的拥挤交通网络配流模型及算法  

Traffic assignment problem model with turning delays for congested networks

作　　者：张雄飞[1] 李瑞敏[1] 郭旭明[1] 史其信[1] 

机构地区：[1]清华大学土木工程系,交通研究所,北京100084

出　　处：《清华大学学报（自然科学版）》2012年第6期848-853,共6页Journal of Tsinghua University(Science and Technology)

基　　金：“十一五”国家科技支撑计划资助项目(2009BAG13A06);国家自然科学基金青年科学基金资助项目(50908125);教育部高等学校博士学科点专项科研基金新教师基金资助项目(200800031059)

摘　　要：为了更加真实准确地反映道路网络的交通流状态,该文综合考虑拥挤交通网络的特点,建立了带转向延误和通行能力限制的交通网络配流模型,模型中路段和转向通行能力约束条件的Lagrange乘子等于因交通拥堵而产生的排队延误。该文采用动态罚函数算法,将原问题转化为一系列不带通行能力限制的传统交通分配问题进行求解,随后以Nguyen Dupuis网络为算例进行测试。计算结果表明:当流量达到通行能力时,排队延误就会产生,平衡流量满足Wardrop均衡准则。该模型能够很好地反映拥挤交通网络流量特点,提出的算法也具有很好的收敛性能。Road network performance is described by a traffic assignment model with turning delays and capacity constraints based on the characteristics of congested networks. The Lagrange multipliers associated with the link capacity and turning capacity constraints are equivalent to the queuing delay of the link or the turn due to traffic congestion. The model was solved using the dynamic penalty function algorithm, which reduced the problem to a series of traditional unconstrained assignment problems. Numerical tests on the Nguyen Dupuis network show that queuing delays occur when the traffic flow reaches capacity and that the equilihrium flow satisfies the Wardrop equilibrium criterion. The model accurately describes the flow patterns of congested networks and the proposed algorithm converges well.

关 键 词：交通网络配流 通行能力限制 转向延误 La-grange乘子 罚函数算法 

分 类 号：U491.1[交通运输工程—交通运输规划与管理]