非对称网络容量约束用户均衡交通分配仿真算法  

A Simulation Algorithm for User Equilibrium Traffic Assignment Problem with Link Capacity Constraints in the Asymmetric Network

作　　者：刘炳全[1,2] 黄崇超[2] 

机构地区：[1]渭南师范学院数学与信息科学学院,渭南714000 [2]武汉大学数学与统计学院,武汉430072

出　　处：《科学技术与工程》2013年第10期2748-2753,共6页Science Technology and Engineering

基　　金：国家自然科学基金项目(71231007;11201351);渭南师范学院科研项目(11YKS024)资助

摘　　要：针对非对称网络路段容量约束交通均衡分配模型计算困难,设计了一种带路段容量约束的用户均衡交通分配仿真算法。在算法迭代过程中,将按全有全无法在当前最短路上分配流量与前一轮迭代所得到的流量加权组合,各O-D对的组合系数依Logit模型来确定;并不断自适应调节路段排队延误因子和误差因子来模拟实际路段行驶时间,使路段流量逐步低于路段容量,从而达到广义用户均衡,克服了容量约束均衡分配计算量大及Logit随机分配法要求枚举所有路径的困难。随后证明了算法的收敛性,并对一个小型路网进行了数值试验。In problem with link the asymmetric network, an efficient algorithm is presented for user equilibrium traffic assignment capacity constraints to circumvent the costly solution of the constrained equilibrium assignment model. In each iteration process, the path flow volumes on each path are updated by weighted summing the path flow volume assigned to current shortest paths and the ones obtained in an early iteration, and the weight coefficient is de- termined by Logit model in each O-D pair. The method ensures gradually the links flow lower than corresponding ca- pacity and trends to generalized user equilibrium by simulating realistic link travel time and adaptively regulating the delay and error factors. It is superior to the Logit-based stochastic equilibrium method owing to avoiding the paths nu- meration. Both the convergence result and the numerical example show this algorithm is effective and efficient.

关 键 词：交通分配 容量约束 变分不等式 仿真算法 

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