交通管控条件下拥堵交通网络流分配模型及算法

发布时间：2018-06-17 17:40

本文选题：用户均衡模型 + 转向延误　；参考：《东南大学》2015年硕士论文

【摘要】：为了使交通分配模型更真实的反映路网中的现实情况,考虑了交叉口延误和路段容量对交通分配的影响,建立了带转向延误和路段容量约束的用户均衡交通流分配模型。模型的求解算法能得到路径信息,在此基础上,为交通管理措施的优化提供参考和依据。论文首先介绍交通管控的条件,主要有路段和交叉口的管理条件,并阐述了特点和适用范围,结合交通网络流理论的特点,将这些管理条件进行数学化处理。路段管理条件中,通过设置不用的路段自由旅行时间函数值来控制该路段单行或是禁行的管理方式；交叉口的管理方式则是引进了转向延误条件来描述交通管理措施。基于路径构建了带转向延误的用户均衡模型。采用带转向延误的Projection Gradient算法进行求解,相比于经典的Frank-Wolfe算法,Projection Gradient算法更为高效。算例分析表明,该模型能较好的反映交叉口延误对交通分配的影响,Projection Gradient算法能得到路径解,可以确定某一路段的流量来自哪里并流向何处,通过对某一转向进行限制,可以清晰的知道流量的转移情况,为交通管控措施提供科学的决策手段。构建了考虑转向延误和路段容量约束的交通分配模型。求解算法方面,内循环采用带转向延误的Projection Gradient算法,外循环采用拉格朗日乘子法进行求解,并用算例验证了算法的可行性。算例表明,添加容量约束条件之后,路段流量均在路段容量范围内,是一种较为理想的交通流分布状态,为分析交通拥堵状态和改善交通提供了方向。交通管理措施的优化。以Sioux Falls网络为例,在考虑交叉口转向延误的路网中,基于路径和路段信息采用相应的交通管控措施,改变整个路网的交通流分布状态,使之接近考虑交叉口转向延误和路段容量约束的交通流分布状态。算例表明,采取适当的交通管控措施之后,能有效的减少过饱和路段的数量,接近了有容量约束的分布状态,有效的缓解了交通拥堵。
[Abstract]:In order to make the traffic assignment model reflect the reality of road network more realistically, considering the influence of intersection delay and section capacity on traffic assignment, a user equilibrium traffic flow assignment model with steering delay and section capacity constraints is established. The algorithm of solving the model can get the path information, and on this basis, it can provide the reference and basis for the optimization of traffic management measures. Firstly, the paper introduces the conditions of traffic control, including the management conditions of road sections and intersections, and expounds the characteristics and applicable scope. Combined with the characteristics of traffic network flow theory, these management conditions are mathematically treated. In the condition of road section management, the management mode of the section is controlled by setting the free travel time function value of the unused road section, and the management mode of intersection is to introduce the steering delay condition to describe the traffic management measures. A user equilibrium model with steering delay is constructed based on path. Compared with the classical Frank-Wolfe algorithm, the projection gradient algorithm is more efficient than the classical Frank-Wolfe algorithm. The example analysis shows that the model can better reflect the influence of intersection delay on traffic assignment. The path solution can be obtained by the projection gradient algorithm. The flow of a certain section can be determined where and where it flows. Can clearly know the flow of the transfer situation, for traffic control measures to provide a scientific means of decision-making. A traffic assignment model considering steering delay and capacity constraints is constructed. In terms of the algorithm, the inner loop is solved by the projection gradient algorithm with steering delay, and the outer loop is solved by the Lagrange multiplier method. The feasibility of the algorithm is verified by an example. The numerical examples show that the traffic flow is within the range of section capacity, which is an ideal state of traffic flow distribution, which provides a direction for analyzing traffic congestion and improving traffic. Optimization of traffic management measures. Taking Sioux Falls network as an example, the traffic flow distribution of the whole road network is changed by adopting the corresponding traffic control measures based on the path and road information in the road network considering the intersection turning delay. It is close to the traffic flow distribution state which takes into account the intersection turning delay and section capacity constraints. The numerical examples show that the number of supersaturated sections can be reduced effectively after taking appropriate traffic control measures, which is close to the distribution state with capacity constraints, and the traffic congestion can be effectively alleviated.
【学位授予单位】：东南大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：U491

【相似文献】