考虑干线协调控制的城市最优路径搜索算法  

Urban shortest path searching algorithm considering coordinate control of arterial intersections

作　　者：周熙阳 杨兆升[1,2,3] 张伟[1,2,4] 邴其春[1] 商强[1] 

机构地区：[1]吉林大学交通学院,长春130022 [2]吉林大学汽车仿真与控制国家重点实验室,长春130022 [3]吉林大学吉林省道路交通重点实验室,长春130022 [4]山东高速公路股份有限公司,济南250014

出　　处：《吉林大学学报（工学版）》2016年第6期1799-1806,共8页Journal of Jilin University:Engineering and Technology Edition

基　　金：国家科技支撑计划项目(2014BAG03803)

摘　　要：针对现有最优路径搜索算法没有考虑到干线协调控制的情况,导致搜索到的最优路径实际效果不佳等问题,提出了一种考虑干线协调控制的城市最优路径搜索算法。首先,将相位差引入到干线协调配时方案中,提出了一种改进的信号交叉口等待时间模型。然后,以IDA~＊算法为基础,提出了一种考虑干线协调控制的改进IDA~＊搜索算法（AICIDA~＊算法）,以路径总时间费用和运算时间为评价指标进行了算例验证。结果表明：与传统算法和考虑干线协调控制的A~＊算法（AICA~＊算法）相比,AICIDA~＊算法能够在更短的时间内搜索到费用更低的路径。Existing shortest path searching algorithms do not consider the coordinate control of arterial intersections, which leads to unsatisfactory searching results. To overcome this drawback an urban shortest path algorithm is developed, which takes the coordinate control of arterial intersections into consideration. First, with the analysis of the coordinate signal timing at the arterial intersections and the offset parameter, an improved signal intersection waiting time model is proposed. Second, with the combination of IDA^＊ algorithm and the improved signal waiting time model, an improved IDA^＊ algorithm considering the coordinate control of arterial intersections （AICIDA^＊ ） is developed. The AICIDA^＊ algorithm is compared with two traditional algorithms and an improved A^＊ algorithm considering the coordinate control of arterial intersections （AICA^＊ ） through a case study, in which the path time cost and computing time are taken as the evaluation indexes. Results show that the proposed AICIDA^＊ algorithm can obtain the better path time cost in a shorter computing time.

关 键 词：交通运输系统工程 最优路径搜索算法 干线协调控制 信号交叉口等待时间 IDA＊算法 

分 类 号：U491.1[交通运输工程—交通运输规划与管理]