메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Exploring time varying shortest path of urban OD pairs based on floating car data

Author keywords

Floating car data; GIS; Time varying shortest path; Transport network

Indexed keywords

CONGESTION INDEX; DEPARTURE TIME; EXPERIMENTAL PROTOTYPE; FLOATING CAR DATA; FLOATING CARS; GIS; LINK TRAVEL TIME; MAP MATCHING PROCESS; OD PAIRS; REAL APPLICATIONS; REAL-TIME TRAFFIC INFORMATION; ROAD LINKS; ROAD NETWORK; SHORTEST PATH; SHORTEST PATH ALGORITHMS; TIME VARYING; TRAFFIC DENSITIES; TRAFFIC FORECASTS; TRAFFIC STATE; TRANSPORT NETWORKS; TRAVEL TIME; URBAN ROAD NETWORKS; WUHAN , CHINA;

EID: 77958054799     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GEOINFORMATICS.2010.5567477     Document Type: Conference Paper
Times cited : (12)

References (12)
  • 1
    • 33645149985 scopus 로고    scopus 로고
    • A Road TimetableTM to aid vehicle routing and scheduling
    • Eglese, R., W. Maden, and A. Slater, "A Road TimetableTM to aid vehicle routing and scheduling". Computers & Operations Research, vol. 33(12), pp. 3508-3519, 2006.
    • (2006) Computers & Operations Research , vol.33 , Issue.12 , pp. 3508-3519
    • Eglese, R.1    Maden, W.2    Slater, A.3
  • 2
    • 44649173270 scopus 로고    scopus 로고
    • A Multi-level Route-planning Algorithm Based on Real-time Traffic Information in Embedded Enviorment
    • April
    • Zhixiang, F. and S. Ying, "A Multi-level Route-planning Algorithm Based on Real-time Traffic Information In Embedded Enviorment". Geomatic and Information Science of Wuhan University, vol. 33(4), pp.397-401,April.2008.
    • (2008) Geomatic and Information Science of Wuhan University , vol.33 , Issue.4 , pp. 397-401
    • Zhixiang, F.1    Ying, S.2
  • 3
    • 3042529730 scopus 로고    scopus 로고
    • Time-Varying Travel Times in Vehicle Routing
    • Fleischmann, B., M. Gietz, and S. Gnutzmann, "Time-Varying Travel Times in Vehicle Routing". Transportation Science, vol.38(2), pp.160-173. 2004.
    • (2004) Transportation Science , vol.38 , Issue.2 , pp. 160-173
    • Fleischmann, B.1    Gietz, M.2    Gnutzmann, S.3
  • 5
    • 0342647396 scopus 로고    scopus 로고
    • Shortest paths in a network with time-dependent flow speeds
    • DOI 10.1016/S0377-2217(99)00035-1
    • Sung, K., et al., "Shortest paths in a network with time-dependent flow speeds". European Journal of Operational Research, vol.121(1), pp.32-39,2000 (Pubitemid 30546342)
    • (2000) European Journal of Operational Research , vol.121 , Issue.1 , pp. 32-39
    • Sung, K.1    Bell, M.G.H.2    Seong, M.3    Park, S.4
  • 6
    • 1942476162 scopus 로고    scopus 로고
    • Computational tools for measuring space-time accessibility within transportation networks with dynamic flow
    • Wu, Y.-H. and H. J.Miller, "Computational tools for measuring space-time accessibility within transportation networks with dynamic flow". Journal of Transportation and Statistics, vol. 4(2), pp.1-14, 2002.
    • (2002) Journal of Transportation and Statistics , vol.4 , Issue.2 , pp. 1-14
    • Wu, Y.-H.1    Miller, H.J.2
  • 7
    • 0037375141 scopus 로고    scopus 로고
    • Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
    • Miller-Hooks, E. and H. Mahmassani, "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks". European Journal of Operational Research, vol. 146(1), pp.67-82, 2003.
    • (2003) European Journal of Operational Research , vol.146 , Issue.1 , pp. 67-82
    • Miller-Hooks, E.1    Mahmassani, H.2
  • 8
    • 85011017713 scopus 로고    scopus 로고
    • Adaptive Fastest Path Computing on a Road Network: A Traffic Mining Approach
    • Gonzalez, H., et al., "Adaptive Fastest Path Computing On a Road Network: A Traffic Mining Approach", in VLDB 2007. 2007: Vienna Austria,p.794
    • VLDB 2007. 2007: Vienna Austria , pp. 794
    • Gonzalez, H.1


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