Simple Method for Reliability Analysis by Searching the N-th Shortest Path and its application to the Evaluation of Traffic Management Schemes
-
- NAKAGAWA Shinji
- (社) システム科学研究所
-
- WAKABAYASHI Hiroshi
- 名城大学都市情報学部都市情報学科
-
- IIDA Yasunori
- 京都大学大学院工学研究科土木工学専攻
Bibliographic Information
- Other Title
-
- n番目最短経路探索を用いた簡便な道路網信頼性解析法とその交通管理運用策への適用
Abstract
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.
Journal
-
- INFRASTRUCTURE PLANNING REVIEW
-
INFRASTRUCTURE PLANNING REVIEW 13 861-868, 1996
Japan Society of Civil Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1390282679611794816
-
- NII Article ID
- 130003839950
-
- ISSN
- 18848303
- 09134034
-
- Data Source
-
- JaLC
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed