考虑瓶颈路段饱和度的交通需求控制评价

1)东南大学交通学院,江苏南京 210096; 2)江苏省城市规划设计研究院,江苏南京 210013

交通工程与交通管理; 交通需求控制; 瓶颈路段饱和度; 交通悖论; 双层数学规划模型; 相继平均算法

Evaluation of traffic demand control by considering the saturation of bottleneck links
TU Qiang1, CHENG Lin1, MA Jie1, and JI Kui2

1)School of Transportation, Southeast University, Nanjing 210096, Jiangsu Province, P.R.China2)Jiangsu Institute of Urban Planning, Nanjing 210013, Jiangsu Province, P.R.China

transportation engineering and management; traffic demand control; the saturation of bottleneck link; traffic paradox; bi-level mathematical programming model; method of successive average

DOI: 10.3724/SP.J.1249.2018.02206

备注

基于起讫点交通量的减少可能导致道路中某些路段的流量增加,分析瓶颈路段饱和度作为交通需求控制评价指标的必要性.提出考虑瓶颈路段饱和度的交通需求控制评价方法,建立双层数学规划模型,提出求解算法.以Nguyen-Dupuis网络为例,设计了15种方案,进行11组数值实验,分析各方案中路网总费用、路网平均饱和度及瓶颈路段饱和度3项指标随交通需求控制强度的变化.结果表明,各方案路网总费用和平均饱和度评价指标差异在2.25%以内,而各方案的瓶颈路段饱和度指标差异较大,最大时达到7.65%,且部分交通需求控制方案可能会导致瓶颈路段拥堵加剧,说明考虑瓶颈路段饱和度指标的重要性.通过分析路径流量的变化,解释了瓶颈路段饱和度变化的内在原因.

Considering the traffic paradox phenomenon, which is the decrease of origin-destination(OD)traffic volume may lead to flow increase on certain links of road network, we analyze the necessity of the saturation of bottleneck links that are used as an index to evaluate the traffic demand control. We propose an evaluation method by analyzing three indexes including road-network total cost, road-network mean saturation and the saturation of bottleneck links,comprehensively. We build a bi-level mathematical programming model and develop the solving algorithm. Taking the Nguyen-Dupuis network as an example, we design 15 schemes to conduct 11 pairs of numerical experiments and analyze the variations of three indexes with the changes of different intensities of traffic demand control in every scheme. The results indicate that the differences of the indexes of road-network total cost and mean saturation among the designed schemes are within 2.25%, which is not great. Oppositely, the differences of the saturation index of the bottleneck links among the designed schemes are great and the maximum difference reaches 7.65%. Moreover, some schemes may lead to more serious congestion in bottleneck links, which further proves the importance of considering the saturation of bottleneck links. Finally, the reason of the saturation variation of the bottleneck links is investigated by analyzing the change of the path flow.

·