Calculation connectivity reliability of road networks based on recursive decomposition arithmetic  

基于递推分解法的路网连通可靠度计算(英文)

作　　者：潘艳荣[1] 邓卫[1] 

机构地区：[1]东南大学交通学院,南京210096

出　　处：《Journal of Southeast University(English Edition)》2008年第1期85-89,共5页东南大学学报（英文版）

基　　金：The National Key Technology R& D Program of Chinaduring the 11th Five-Year Plan Period (No.2006BAJ18B03).

摘　　要：In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.为了降低道路网连通可靠度计算的复杂度,提出了基于递推分解法的可靠度计算方法.首先阐述了递推分解算法的基础理论,然后对道路网不同于常规网络的特性进行了分析,最后提出了适合于道路网络连通可靠度计算的改进的递推分解算法,同时给出了方便计算机编程实现的具体求解步骤,并对相应的上下限近似算法的优越性进行了分析.改进的递推分解算法打破了传统的先搜索最小路然后进行不交化的连通可靠度求解步骤,直接生成计算中涉及到的不交最小路,并充分考虑了道路网的实际特性,大大简化了计算,避免了可靠度计算中的NP难题.最后通过一简例,说明该算法的实用性.

关 键 词：recursive decomposition arithmetic road network connectivity reliability disjoint minipath topological structure 

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