메뉴 건너뛰기




Volumn 3, Issue 4, 2009, Pages 969-974

Continuous fastest path planning in road networks by mining real-timetraffic event information

Author keywords

Data mining; Fastest path planning; Navigation system; Traffic event

Indexed keywords

EVENT PREDICTION; FASTEST PATH PLANNING; PATH-PLANNING; REAL TIME TRAFFICS; ROAD NETWORK; SYSTEM CONDITIONS; TRAFFIC EVENT;

EID: 77953887298     PISSN: 1881803X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (7)

References (12)
  • 4
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • E. W. Dijkstra, A note on two problems in connection with graphs,Numerische Mathematik, vol.1, no.1, 1959.
    • (1959) Numerische Mathematik , vol.1 , Issue.1
    • Dijkstra, E.W.1
  • 11
    • 62849087497 scopus 로고    scopus 로고
    • Energy-efficient real-time object tracking in multi-level sensor networksby mining and predicting movement patterns
    • V. S. Tseng and E. H.-C. Lu, Energy-efficient real-time object trackingin multi-level sensor networks by mining and predicting movement patterns,Journal of Systems and Software, vol.82, no.4, 2009.
    • (2009) Journal of Systems and Software , vol.82 , Issue.4
    • Tseng, V.S.1    Lu, E.H.-C.2
  • 12
    • 64349104484 scopus 로고    scopus 로고
    • An empirical study of a pure genetic algorithm to solve the capacitatedvehicle routing problem
    • Y. Wu, P. Ji and T. Wang, An empirical study of a pure genetic algorithmto solve the capacitated vehicle routing problem, ICIC Express Letters, vol.2,no.1, 2008.
    • (2008) ICIC Express Letters , vol.2 , Issue.1
    • Wu, Y.1    Ji, P.2    Wang, T.3


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