摘要
城市路网中由于交叉口转向延误不可忽略,因此需要能够考虑转向延误的最短路径求解算法。传统的存储结构没有考虑转向延误,不再适应考虑延误后的新算法。在对比分析传统存储结构的基础上,通过引入新指针,对传统邻接链表结构进行了改进,使其能够高效率地实现节点延误的存储,并且给出了该结构的C++类模板实现方法。这些为交通管理规划实施事先评价和实现交通流诱导提供支持。
Compared with travel time on the link, the interseetion turning delays （turning prohibitions are usually treated as infinite delay） are great and can＇t be neglected in urban road system. So an algorithm which is able to considerate node turning delays and prohibitions is strongly recommended. Traditional representations of network don＇t contain these delays, so they can＇t be applied in the new algorithms which take these delays into account. Based on the analysis of traditional network representations, an additional pointer was presented here to modify the adjacency list structure. This added pointer points to an array which stores all the turning delays of one approach in intersection. The modified structure can represents the network with turning delays conveniently and efficiently without adding too many units in contrast with previous representation. Codes of this structure in C ＋＋ are also presented.All these works make great help to the prior appraisal of measurements in traffic management planning and the real time guidance of traffic flow.
出处
《公路交通科技》
CAS
CSCD
北大核心
2007年第1期134-138,共5页
Journal of Highway and Transportation Research and Development
基金
国家重点基础研究发展计划(973计划)资助项目(2006CB705500)
国家自然科学基金资助项目(50578037)
关键词
最短路径
交叉口延误
改进邻接链表
转向禁止
shortest path
intersection delays
modified adjacency list
intersection fuming prohibitions
