交通运输系统工程与信息 ›› 2015, Vol. 15 ›› Issue (6): 197-204.

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

随机交通网络连通可靠度改进算法

范文博,王佳伟,杨成*   

  1. 西南交通大学,成都610031
  • 收稿日期:2015-06-09 修回日期:2015-09-24 出版日期:2015-12-25 发布日期:2015-12-25
  • 作者简介:范文博(1981-),男,河南商丘人,讲师,博士.
  • 基金资助:

    国家自然基金项目(51378432);中央高校基本科研业务科技创新项目(2682015CX042)

Improved Algorithm for Stochastic Network Connectivity Reliability

FANWen-bo,WANG Jia-wei,YANG Cheng   

  1. Southwest Jiaotong University,Chengdu 610031,China
  • Received:2015-06-09 Revised:2015-09-24 Online:2015-12-25 Published:2015-12-25

摘要:

连通可靠度作为网络可靠性的基础指标是指导交通事故预防、灾后重建和日 常维护等活动的重要理论,但其计算是经典的NP难问题.为了提高大规模网络应用的求 解精度和效率,提出了基于k-最短路径和状态排序的改进算法——Target_Order 算法,集 中考察影响网络连通性的关键节点及其状态,有效减少了无关网络连通性的节点组合产 生的冗余网络状态,大幅降低了计算复杂度.最后,以成都规划年地铁网为例,通过与传统 算法(ORDER算法)比较,分析了算法关键参数的影响,验证了改进算法在精度与效率方 面的显著优势.研究结果同样适用于其他随机交通网络的连通可靠度计算与统计.

关键词: 城市交通, 连通可靠度, ORDER算法, Target_Order算法, 随机交通网络

Abstract:

As the basic indicator of network reliability, connectivity reliability analysis provides theoretical basis for practices of traffic accident prevention, post-disaster reconstruction, operational maintenance, etc. The computation of connectivity reliability, however, is a typical NP-hard problem. In order to improve the computing accuracy and efficiency of large-scale network application, an improved algorithm (called Target_Order) is proposed based on k- shortest path algorithm and ORDER algorithm (which is used to produce the most probable network states). Chengdu metro network (year of 2020) is selected as an example to explore the impact of algorithm parameters and illustrate the considerable advantages of the proposed algorithm against traditional ORDER algorithm in terms of computational accuracy and efficiency. The improved solution algorithm can be also applied to connectivity reliability evaluations of other transportation networks (e.g., railway and highway).

Key words: urban traffic, connectivity reliability, ORDER algorithm, Target_Order, stochastic network

中图分类号: