检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐广宁[1] 王印海[1,2] 曾自强[2,3] 安实[1]
机构地区:[1]哈尔滨工业大学交通科学与工程学院,哈尔滨150090 [2]美国华盛顿大学土木与环境工程学院,美国华盛顿州西雅图市98195 [3]四川大学商学院不确定决策实验室,成都610065
出 处:《交通信息与安全》2017年第3期90-97,共8页Journal of Transport Information and Safety
基 金:国家自然科学基金项目(51138003)资助
摘 要:根据对实时路况的数据处理方式,常见的动态路径规划策略可分为瞬时阻抗T-SPF和平均阻抗A-SPF两种方式。如何验证这些策略的个体效益及其对城市路网的中长期影响一直是相关系统部署的核心问题。针对这一问题,通过Vissim的Car2X模块与自定义程序实现了仿真中的动态转向,并以现实路网为蓝本,对T-SPF和A-SPF在不同程度的市场占有率情况下的运行性能进行了测试。测试结果表明2种现有策略都存在各自的问题;当市场占有率达到15%以上时,T-SPF策略可能令路网的通行容量处于振荡状态,而实施了A-SPF的路网的平均延误和通行量表现稳定,但在个体效益方面表现还不如静态策略。建议为城市路网实施路径规划时设计新的策略以及与之匹配的信号优化机制。Traditional strategies of dynamic route planning can be divided into Transient-value-based Shortest-Path- Finding (T-SPF) and Average-value-based Shortest-Path-Finding (A-SPF) in term of processing for real-time traffic con-ditions. It is significant for traffic management departments to know how to balance individual benefits and long-term im- pacts of these strategies. To this end〉 a series of situations based on actual road networks are simulated. Vissim Car2X module and customized programs are applied to achieve dynamic steering during the simulations. The results show that the performances of T-SPF and A-SPF under different levels of market share have their own problems. When the market share is higher than 15%,the T-SPF strategy may cause an oscillatory state in traffic capacity of urban road networks. The A-SPF strategy can achieve stable performance in average delay and traffic throughput of road networks under the same conditions. However, it shows poor performance in individual benefit. Suggestions for solving these problems are coordination of a new route planning strategy, and enhancement of an adaptive signal control policy.
关 键 词:智能交通 城市路网 路径规划策略 微观交通仿真 车载导航 自动驾驶汽车
分 类 号:U492.2[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.19.234.118