检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:檀文芳 林丽[1] 黄霖霖 TAN Wenfang;LIN Li;HUANG Linlin(College of Automobile and Traffic Engineering,Nanjing Forestry University,Nanjing 210037)
机构地区:[1]南京林业大学汽车与交通工程学院,南京210037
出 处:《森林工程》2019年第1期93-99,106,共8页Forest Engineering
基 金:住房城乡建设部2014年科学技术计划项目(2014-K5-007)
摘 要:为提高交叉口处公交车辆运行效率,在停车线法的基础上针对公交优先感应信号控制进行研究,提出公交车辆检测器的设置距离模型。以整体交叉口以人为单位的通行能力的增加量作为指标,分别建立绿灯延长、红灯缩短和插入相位3种方式下的目标函数,并以函数最优化为目标,求出所设公交车辆检测器的最优位置模型,并借助VISSIM仿真软件,对检测器位置模型进行可行性验证。结果表明,将本文提出的检测器位置模型应用于公交优先控制策略后,整体交叉口以车辆为单位和以人为单位的通行能力均有所增加,且对于交叉口其余社会车辆的延误影响较小。本文提出的检测器位置模型具有可行性,在充分体现以人为本的理念下,该距离模型下的公交优先策略所带来的增长效益大于所导致的减少效益,有效减少了公交车在交叉口处的停车等待时间,提高公交车辆的通行能力。In order to improve the operation efficiency and attraction of bus at intersections,a distance model of bus detector is proposed based on the parking line method.Taking the increment of traffic capacity as an index,the objective functions of green light extension,red light shortening and insertion phase are established respectively,and the optimal location model of the bus detector is obtained by optimizing the function.The location of the detector is simulated by VISSIM software.The feasibility of the model is verified.The results show that after applying the proposed detector position model to the bus priority control strategy,the capacity of the whole intersection with vehicles as the unit and people as the unit is increased,and the delay of the other social vehicles at the intersection is less affected.The results show that the detector position model proposed in this paper is feasible.The growth benefit of the bus priority strategy under the distance model is greater than the reduction benefit,which effectively reduces the waiting time of the bus at the intersection and improves the capacity of the bus.
分 类 号:U491.54[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43