期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Calculation connectivity reliability of road networks based on recursive decomposition arithmetic 被引量:2
1
作者 潘艳荣 邓卫 《Journal of Southeast University(English Edition)》 EI CAS 2008年第1期85-89,共5页
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 i... 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. 展开更多
关键词 recursive decomposition arithmetic road network connectivity reliability disjoint minipath topological structure
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部