메뉴 건너뛰기




Volumn 2, Issue 3, 2008, Pages 219-227

Route computation in large road networks: A hierarchical approach

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; ELECTRONIC GUIDANCE SYSTEMS; HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; MOTOR TRANSPORTATION; NETWORK ROUTING; ROADS AND STREETS; TRAFFIC CONTROL; TRANSPORTATION ROUTES;

EID: 49149102479     PISSN: 1751956X     EISSN: None     Source Type: Journal    
DOI: 10.1049/iet-its:20080012     Document Type: Article
Times cited : (16)

References (20)
  • 2
    • 0031997181 scopus 로고    scopus 로고
    • Shortest path algorithms: An evaluation using real road networks
    • 0041-1655
    • Zhan, F.B., and Noon, C.E.: ' Shortest path algorithms: an evaluation using real road networks ', Transp. Sci., 1998, 32, (1), p. 65-73 0041-1655
    • (1998) Transp. Sci. , vol.32 , Issue.1 , pp. 65-73
    • Zhan, F.B.1    Noon, C.E.2
  • 3
    • 0023421864 scopus 로고
    • Planning as search: A quantitative approach
    • 10.1016/0004-3702(87)90051-8 0004-3702
    • Korf, R.E.: ' Planning as search: a quantitative approach ', Artif. Intell., 1989, 33, p. 65-88 10.1016/0004-3702(87)90051-8 0004-3702
    • (1989) Artif. Intell. , vol.33 , pp. 65-88
    • Korf, R.E.1
  • 4
    • 0028562507 scopus 로고
    • General principles of hierarchical spatial reasoning - The case of wayfinding
    • Car, A., and Frank, A.U.: ' General principles of hierarchical spatial reasoning - the case of wayfinding ', Proc. 6th Int. Symp. Spatial Data Handling, 1994, 2, p. 646-664
    • (1994) Proc. 6th Int. Symp. Spatial Data Handling , vol.2 , pp. 646-664
    • Car, A.1    Frank, A.U.2
  • 5
    • 0009719432 scopus 로고    scopus 로고
    • Intelligent route finding: Combining knowledge, cases and an efficient search algorithm
    • Liu, B.: ' Intelligent route finding: combining knowledge, cases and an efficient search algorithm ', Proc. 12th Int. Conf. Artificial Intelligence, 1996, p. 380-384
    • (1996) Proc. 12th Int. Conf. Artificial Intelligence , pp. 380-384
    • Liu, B.1
  • 11
    • 0032071072 scopus 로고    scopus 로고
    • Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation
    • 10.1109/69.687976 1041-4347
    • Jing, N., Huang, Y., and Rundensteiner, E.A.: ' Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation ', IEEE Trans. Knowl. Data Eng., 1998, 10, (3), p. 409-432 10.1109/69.687976 1041-4347
    • (1998) IEEE Trans. Knowl. Data Eng. , vol.10 , Issue.3 , pp. 409-432
    • Jing, N.1    Huang, Y.2    Rundensteiner, E.A.3
  • 12
    • 0036709198 scopus 로고    scopus 로고
    • An efficient path computation model for hierarchically structured topographical road maps
    • 10.1109/TKDE.2002.1033772 1041-4347
    • Jung, S., and Pramanik, S.: ' An efficient path computation model for hierarchically structured topographical road maps ', IEEE Trans. Knowl. Data Eng., 2002, 14, (5), p. 1029-1046 10.1109/TKDE.2002.1033772 1041-4347
    • (2002) IEEE Trans. Knowl. Data Eng. , vol.14 , Issue.5 , pp. 1029-1046
    • Jung, S.1    Pramanik, S.2
  • 16
    • 0003021178 scopus 로고    scopus 로고
    • Approximating shortest paths in large-scale networks with an application to intelligent transportation systems
    • 0899-1499
    • Chou, Y.L., Romeijn, H.E., and Smith, R.L.: ' Approximating shortest paths in large-scale networks with an application to intelligent transportation systems ', INFORMS J. Comput., 1998, 10, (2), p. 163-179 0899-1499
    • (1998) INFORMS J. Comput. , vol.10 , Issue.2 , pp. 163-179
    • Chou, Y.L.1    Romeijn, H.E.2    Smith, R.L.3
  • 17
    • 0347371767 scopus 로고    scopus 로고
    • Heuristic techniques for accelerating hierarchical routing on road networks
    • 10.1109/TITS.2002.806806 1524-9050
    • Jagadeesh, G.R., Srikanthan, T., and Quek, K.H.: ' Heuristic techniques for accelerating hierarchical routing on road networks ', IEEE Trans. Intell. Transp. Syst., 2002, 3, (4), p. 301-309 10.1109/TITS.2002.806806 1524-9050
    • (2002) IEEE Trans. Intell. Transp. Syst. , vol.3 , Issue.4 , pp. 301-309
    • Jagadeesh, G.R.1    Srikanthan, T.2    Quek, K.H.3
  • 18
    • 0001623204 scopus 로고
    • A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures
    • 0041-1655
    • Habbal, M.B., Koutsopoulos, H.N., and Lerman, S.R.: ' A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures ', Transp. Sci., 1994, 28, (4), p. 292-308 0041-1655
    • (1994) Transp. Sci. , vol.28 , Issue.4 , pp. 292-308
    • Habbal, M.B.1    Koutsopoulos, H.N.2    Lerman, S.R.3


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