Simple Method for Reliability Analysis by Searching the N-th Shortest Path and its application to the Evaluation of Traffic Management Schemes
Simple Method for Reliability Analysis by Searching the N-th Shortest Path and its application to the Evaluation of Traffic Management Schemes
复制标题
搜索第N最短路径的简易可靠性分析方法及其在交通管理方案评估中的应用
DOI：
10.2208/journalip.13.861
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
Y. Iida
中科院分区：
文献类型：
--
作者：
S. Nakagawa;H. Wakabayashi;Y. Iida
可靠性可以定性地评价交通状况。但是，路网的可靠性分析是非常困难的，因为交通的特点，如O/D的存在，需要考虑。本文提出了一种有效的可靠度计算方法。该方法通过搜索第n条最短路径减少了网络的规模，可以方便地计算出可靠性的近似值。为了了解该方法的优缺点，以京都城市网络为例进行了数值实验。结果表明，交通信息对不同O/D对的影响是不相同的。
Reliability can evaluate traffic condition qualitatively. But, reliability analysis of road network is very difficult, because the characteristics of traffic, for example-The existence of O/D, need to be considered. In this study, a effective method for calculating reliability is proposed. This method can easily calculate the approximate value of reliability, because of the reduction of the size of network by searching the N-th shortest path. In order to know the advantages and disadvantages of this method, numerical experiments with Kyoto-City network are carried out. As a result, it is shown that the effects of traffic information are not same among different O/D pairs.