메뉴 건너뛰기




Volumn , Issue 9783540680550, 2007, Pages 173-196

Reliability analysis of road networks and preplanning of emergency rescue paths

Author keywords

[No Author keywords available]

Indexed keywords


EID: 77952096010     PISSN: 14309602     EISSN: 21979375     Source Type: Book Series    
DOI: 10.1007/978-3-540-68056-7_9     Document Type: Chapter
Times cited : (4)

References (24)
  • 1
    • 0020115461 scopus 로고
    • A simple technique for computing network reliability
    • Ahmad SH (1982) A simple technique for computing network reliability. IEEE Transactions on Reliability, 31: 41-44
    • (1982) IEEE Transactions on Reliability , vol.31 , pp. 41-44
    • Ahmad, S.H.1
  • 3
    • 0347371808 scopus 로고    scopus 로고
    • Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks
    • Chabini I, Lan S (2002) Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. IEEE Transactions on Intelligent Transportation Systems 3: 60-74
    • (2002) IEEE Transactions on Intelligent Transportation Systems , vol.3 , pp. 60-74
    • Chabini, I.1    Lan, S.2
  • 4
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • Dijkstra EW (1959) A note on two problems in connexion with graphs. Nu-merische Mathematik 1: 269-271
    • (1959) Nu-Merische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 5
    • 0033795394 scopus 로고    scopus 로고
    • Mapping evacuation risk on transportation networks using a spatial optimization model
    • Church RL, Cova TJ (2000) Mapping evacuation risk on transportation networks using a spatial optimization model. Transportation Research C 8: 321-336
    • (2000) Transportation Research C , vol.8 , pp. 321-336
    • Church, R.L.1    Cova, T.J.2
  • 6
    • 0031414074 scopus 로고    scopus 로고
    • Modelling community evacuation vulnerability using GIS
    • Cova TJ, Church RL (1997) Modelling community evacuation vulnerability using GIS. International Journal of GIS 11: 763-784
    • (1997) International Journal of GIS , vol.11 , pp. 763-784
    • Cova, T.J.1    Church, R.L.2
  • 7
    • 0037933474 scopus 로고    scopus 로고
    • A network flow model for lane-based evacuation routing
    • Cova TJ, Johnson JP (2003) A network flow model for lane-based evacuation routing. Transportation Research A 37: 579-604
    • (2003) Transportation Research A , vol.37 , pp. 579-604
    • Cova, T.J.1    Johnson, J.P.2
  • 8
    • 0242344337 scopus 로고
    • Algorithm for solution of a problem of maximum flow in a network with power estimation
    • Dinic EA (1970) Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Dokl. 11: 248-264
    • (1970) Soviet Math. Dokl , vol.11 , pp. 248-264
    • Dinic, E.A.1
  • 9
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k shortest paths
    • Eppstein D (1997) Finding the k shortest paths. SIAM Journal of Computing 28: 652-673
    • (1997) SIAM Journal of Computing , vol.28 , pp. 652-673
    • Eppstein, D.1
  • 10
    • 0015626643 scopus 로고
    • A Boolean algebra method for computing the terminal reliability in a communication network
    • Fratta L, Montanari UG (1973), A Boolean algebra method for computing the terminal reliability in a communication network. IEEE Trans. Circuit Theory 20: 203-211
    • (1973) IEEE Trans. Circuit Theory , vol.20 , pp. 203-211
    • Fratta, L.1    Montanari, U.G.2
  • 13
    • 0002824219 scopus 로고
    • An approximation method of terminal reliability of road network using partial minimal path and cut sets
    • Iida Y, Wakabayashi H (1990) An approximation method of terminal reliability of road network using partial minimal path and cut sets. Proceedings of the 5th WCTR, vol. 4, pp. 367-380
    • (1990) Proceedings of the 5Th WCTR , vol.4 , pp. 367-380
    • Iida, Y.1    Wakabayashi, H.2
  • 14
    • 84957088938 scopus 로고    scopus 로고
    • Computing the K shortest paths: A new algorithm and an experimental comparison
    • Jimenez VM, Marzal A (1999) Computing the K shortest paths: a new algorithm and an experimental comparison. Lecture Notes in Computer Science Series 1688: 15-29
    • (1999) Lecture Notes in Computer Science Series , vol.1688 , pp. 15-29
    • Jimenez, V.M.1    Marzal, A.2
  • 15
    • 23244465489 scopus 로고    scopus 로고
    • Design of survivable networks: A survey
    • Kerivin H, Mahjoub AR (2005) Design of survivable networks: A survey. Networks 46: 1-21
    • (2005) Networks , vol.46 , pp. 1-21
    • Kerivin, H.1    Mahjoub, A.R.2
  • 16
    • 0017678603 scopus 로고
    • Efficient evaluation of system reliability by Monte Carlo method
    • Kumamoto H, Tanaka K, Inoue K (1977) Efficient evaluation of system reliability by Monte Carlo method. IEEE Transactions on Reliability 26: 311-315
    • (1977) IEEE Transactions on Reliabilit , vol.26 , pp. 311-315
    • Kumamoto, H.1    Tanaka, K.2    Inoue, K.3
  • 17
    • 0346940559 scopus 로고
    • A multiple-path routing strategy for vehicle route guidance systems
    • Lee C-K (1994) A multiple-path routing strategy for vehicle route guidance systems. Transportation Research C 2: 185-195
    • (1994) Transportation Research C , vol.2 , pp. 185-195
    • Lee, C.-K.1
  • 19
    • 85039434481 scopus 로고
    • The anti-earthquake reliability analysis of civil building network system
    • Beijing, China
    • Li GQ (1994) The anti-earthquake reliability analysis of civil building network system. Press of Earthquake (in Chinese), Beijing, China
    • (1994) Press of Earthquake (In Chinese)
    • Li, G.Q.1
  • 20
    • 33847200906 scopus 로고    scopus 로고
    • Improving the reliability of street networks in high density populated urban areas
    • Li Y, Tsukaguchi H (1997) Improving the reliability of street networks in high density populated urban areas. In: The reliability of networks, pp. 261-272
    • (1997) The Reliability of Networks , pp. 261-272
    • Li, Y.1    Tsukaguchi, H.2
  • 23
    • 0024701993 scopus 로고
    • Methods for designing communication networks with certain two-connected survivability constraints
    • Monma CL, Shallcross DF (1989) Methods for designing communication networks with certain two-connected survivability constraints. Operations Research 37: 531-541
    • (1989) Operations Research , vol.37 , pp. 531-541
    • Monma, C.L.1    Shallcross, D.F.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.