考虑拥堵空间排队与溢出的道路网静态交通流分配

为刻画拥堵空间排队与溢出现象对交通流分配的影响，提出考虑拥堵空间排队与溢出的道路网静态交通流分配问题，并构建相关的求解算法，用于描述交通需求在起讫点移动过程中路网整体的宏观运行状态。首先，丰富和完善考虑拥堵空间排队与溢出的静态交通流分配的相关假设，提出次生瓶颈、拥堵干扰与渗透和分段化路段阻抗等基本概念和理论，来刻画拥堵交通瓶颈、拥堵空间排队等交通现象；其次，建立网络瓶颈识别算法和空间排队回溯算法，基于此构建考虑拥堵空间排队和溢出的增量分配算法，用于求解交通流分配的结果；最后，通过使用一个具有说明型的算例进行对比分析。研究结果表明：建立的瓶颈识别、排队回溯和增量分配算法可以识别路网中的瓶颈位置及其拥堵排队区域，并可计算得到各路段上的分段分配流量；与点排队只影响瓶颈路段的运行状况和均一的路段分配结果相比，可有效描述路网整体的宏观运行状态以及由于拥堵空间排队所导致的拥堵干扰与渗透现象；不同于“时间片”的伪动态交通流分配模型，新建算法的分配结果是“全时段”与“整体性”的路网宏观运行状态，包含了拥堵瓶颈的具体位置和空间排队的干扰与渗透情况；一般拥堵点排队模型和基于“时间片”的拥堵空间排队模型难以刻画拥堵干扰与渗透现象以及路网整体的宏观运行状态，故所建立的分配方法是对传统拥堵交通流分配的丰富和发展。

Static Traffic Assignment on Road Network with Congestion Spatial Queuing and Spillback

In order to characterize the impact of congestion spatial queuing and spillback on traffic assignment, a road network static traffic assignment problem with spatial queuing and spillback was proposed, and a related solution algorithm was constructed to describe the overall macro operation state of the road network during the movement of traffic demand from origin to destination. First of all, it enriched and perfected the related assumptions of static traffic assignment with congestion spatial queuing and spillback, and proposed basic concepts and theories such as secondary bottlenecks, congestion interference and penetration, and segmented link performance function to describe the traffic phenomenon of congestion traffic bottlenecks and congestion spatial queuing; Secondly, established a network bottleneck identification algorithm and a spatial queuing backtracking algorithm, then based on which, built an incremental assignment algorithm that considered spatial queuing and spillback to solve the result of traffic assignment; Finally, a comparative analysis was carried out by using an illustrative example. The results show that the bottleneck identification, queuing backtracking and incremental assignment algorithms established in this paper can identify the location of the bottleneck in the road network and its congested queuing area, and can calculate the segmental assignment flow on each link. Compared with point queuing that only affects the travel time of the bottleneck link and the uniform assignment result, the algorithms established in this paper can effectively describe the overall macro-operation status of the road network, as well as the phenomena of congestion interference and penetration caused by the spatial queuing. In addition, different from the “time slice” quasi-dynamic traffic assignment model, the result of the new algorithm is the “full time” and “integrity” road network macro operation status, including the specific location of the congestion bottleneck, as well as interference and penetration of spatial queue. The general congestion point queuing model and the congestion spatial queuing model based on “time slices” are difficult to describe the phenomenon of congestion interference and penetration, and the overall macro-operation status of the road network, so the assignment method established in this paper is a rich and comprehensive development of traditional congested traffic assignment.