1) delay of traffic flow on each direction
分流向延误
1.
Then,the Floyd algorithm considering the delay at intersections is proposed to solve the shortest path problem in the network of city road,in which the delay of traffic flow on each direction,such as going straight,turning left or right is fully taken into consideration.
在利用G IS建立城市道路网并通过空间分析判断节点方位和路径走向的基础上,提出了一种具有节点阻抗的F loyd算法来解决城市道路网中的最短路径问题,这里直行、左转或右转的分流向延误得到了充分考虑。
2) delay time at nodes on traffic direction
分向交叉口延误
1.
The delay time at nodes on traffic direction is taken into consideration in the new algorithm and is analysed to make dynamic traffic control and DVGS be fused more easily.
在新算法中通过对交叉口延误的特殊处理,使得城市交通路网中的分向交叉口延误得以充分体现,并有利于将交通导行系统与交通控制系统相融合。
3) turn delay
转向延误
1.
To overcome the shortcomings in traditional network-expanding method for handling turn delays in traffic assignment,a turn-based algorithm for Logit traffic assignment was developed with a similar framework of Dial algorithm,which was based on the topological relationships between network element nodes,links and turns.
为避免交通分配中传统的网络扩展法在处理转向延误时的缺陷,通过分析网络基本要素节点、路段和转向之间的拓扑关系,借鉴Dial算法的基本框架,设计了一个基于转向的Logit交通分配算法。
4) overflow delay
溢流延误
1.
A modification is conducted to classical overflow delay and the average delay model of widened intersection is put forward.
文中详细分析了拓宽路口的车辆驶出率,应用路口拓宽条件下车辆累计到达—离开图给出了拓宽交叉口的均匀延误计算公式,对传统的溢流延误模型进行了修正,进而提出了拓宽交叉口平均延误的计算模型。
6) turn prohibitions and delays
转向限制和延误
1.
Secondly,the structure of search node is defined in the sight of dual graph theory as a solution for turn prohibitions and delays in road intersections.
提出了基于节点的交通网络拓扑关系模型,描述交通网络的物理连通性以及逻辑连通性;根据对偶图的思想,定义搜索节点结构,处理交叉口转向限制和延误;改进传统的Dijkstra算法,提出了基于搜索节点的双向启发式A*算法,使用二叉堆优先级队列存储扩展节点,RB-tree存储标记节点。
补充资料：分流
①从干流中分出一股或几股水流注入另外的河流或单独入海。②（人员、车辆等）分别向不同的道路、方向流动：人车～ㄧ消费资金～。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条