交通运输系统工程与信息 ›› 2014, Vol. 14 ›› Issue (5): 194-201.

• 系统工程理论与方法 • 上一篇    下一篇

随机时变路网环境下稳健路径选择及实证研究

曹慧1,段征宇2,陈川*2   

  1. 1.广州市交通规划研究所,广州510030;2.同济大学交通运输工程学院,上海201804
  • 收稿日期:2014-02-12 修回日期:2014-03-25 出版日期:2014-10-25 发布日期:2014-12-17
  • 作者简介:曹慧(1989-),女,湖北黄石人,硕士生.
  • 基金资助:

    国家自然基金青年基金项目(71001079).

Empirical Research on Robust Optimal Path Problem in Stochastic Time-dependent Networks

CAO Hui1,DUAN Zheng-yu2,CHEN Chuan2   

  1. 1. Guangzhou Transport Planning Research Institute, Guangzhou 510030, China 2. School of Transportation Engineering, Tongji university, Shanghai 201804, China
  • Received:2014-02-12 Revised:2014-03-25 Online:2014-10-25 Published:2014-12-17

摘要:

交通拥挤、天气、突发事故等不确定性因素影响着城市区域之间的路网提供的 连通服务水平.本文对城市片区间道路连通路径选择进行研究.根据随机时变网络描述和 稳健路径选取原则,建立了最优化模型,并采用改进的Dijkstra 算法.通过深圳实例计算, 分析了出发时刻与最短路径行程时间和路段构成之间关系,并与确定性时变路网环境下 进行计算结果对比.结果表明,随机时变路网环境下鲁棒性最优算法选择稳健路径具有合 理性和可行性,可以很好地应用到区域动态连通情况的研究.

关键词: 智能交通, 稳健路径选择, 随机时变路网, 鲁棒性, 路网连通水平

Abstract:

There are many uncertain factors affecting the service level of urban road network. The paper discusses the connecting route problem among urban areas. It proposes a robust optimization model taking the description of stochastic time-dependent network and selecting principles for robust paths into consideration. An advanced Dijkstra algorithm is put forward to solve the problem. Using Shenzhen GPS data, the paper establishes a stochastic time-dependent network, and studies the model and algorithm of the optimal robust path. The results indicate that the travel time varies from the different departure time, and the components of path are not the same, neither. At last, the result is compared with ones which are obtained by a normal algorithm based on time-dependent network. The comparison shows that the advanced algorithm is an effective method to apply into selecting robust route among urban areas.

Key words: intelligent transportation, robust optimal path, stochastic time- dependent network, robust optimization, connectivity of road network

中图分类号: