메뉴 건너뛰기




Volumn , Issue , 2014, Pages 303-306

Research on the optimal route choice based on improved Dijkstra

Author keywords

Dijkstra algorithm; Traffic congestion; Weight function

Indexed keywords

ENGINEERING RESEARCH; GRAPH THEORY; TRANSPORTATION ROUTES;

EID: 84937131225     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WARTIA.2014.6976257     Document Type: Conference Paper
Times cited : (17)

References (14)
  • 1
    • 84905229746 scopus 로고    scopus 로고
    • Improved Dijkstra algorithm in the application and simulation of parking guidance system
    • H. G. Peng F. L. Xie. Improved Dijkstra algorithm in the application and simulation of parking guidance system. Journal of Computer Applications, 2011, vol. 31, pp. 63-66.
    • (2011) Journal of Computer Applications , vol.31 , pp. 63-66
    • Peng, H.G.1    Xie, L.F.2
  • 2
    • 84927765616 scopus 로고    scopus 로고
    • Improvement and research of dijkstra algorithm in embedded GIS
    • D. H. Jiang, L. Dai. Improvement and research of Dijkstra algorithm in embedded GIS. Computer Engineering and Applications, 2011, vol. 47, pp. 209-211
    • (2011) Computer Engineering and Applications , vol.47 , pp. 209-211
    • Jiang, D.H.1    Dai, L.2
  • 3
    • 71049177784 scopus 로고    scopus 로고
    • The shortest path algorithm sectoral Dijkstra between customers under complex network
    • S. F. Zheng, J. D. Cao, X. M. Lian. The shortest path algorithm sectoral Dijkstra between customers under complex network. Journal of Tsinghua University(Science and Technology), 2009, vol. 49, pp. 1834-1837
    • (2009) Journal of Tsinghua University(Science and Technology) , vol.49 , pp. 1834-1837
    • Zheng, S.F.1    Cao, J.D.2    Lian, X.M.3
  • 6
    • 84937136829 scopus 로고    scopus 로고
    • Dynamically shortest circuit calculation method Based on improved Dijkstra algorithm[J]
    • S. F. Ma, S. Q. Ma. Dynamically shortest circuit calculation method Based on improved Dijkstra algorithm[J]. Systems Engineering-Theory & Practice, 2011, vol. 31, pp. 1153-1157
    • (2011) Systems Engineering-Theory & Practice , vol.31 , pp. 1153-1157
    • Ma, S.F.1    Ma, S.Q.2
  • 7
    • 33846926749 scopus 로고    scopus 로고
    • An improved Dijkstra's path algorithm for sparse network [J]
    • M. H. Xu, Y. Q. Liu. An improved Dijkstra's path algorithm for sparse network [J]. Applied Mathematics and Computation, 2007, vol. 185, 247-254.
    • (2007) Applied Mathematics and Computation , vol.185 , pp. 247-254
    • Xu, M.H.1    Liu, Y.Q.2
  • 8
    • 3242702293 scopus 로고    scopus 로고
    • Improved algorithm for all pairs shortest paths [J]
    • Y. Han. Improved algorithm for all pairs shortest paths [J]. Inform Process Lett, 2004, vol. 91, pp. 245-250.
    • (2004) Inform Process Lett , vol.91 , pp. 245-250
    • Han, Y.1
  • 9
    • 84937160767 scopus 로고    scopus 로고
    • Improved dijkstra algorithm in the application of the port logistics [J]
    • J. T. Cai, K. M. Wu. Improved Dijkstra algorithm in the application of the port logistics [J]. Computer & Digital Engineering, 2014, vol. 42, pp. 771-774.
    • (2014) Computer & Digital Engineering , vol.42 , pp. 771-774
    • Cai, J.T.1    Wu, K.M.2
  • 11
    • 84863351089 scopus 로고    scopus 로고
    • The improved dijkstra's shortest path algorithm and its application [J]
    • S. X. Wang. The Improved Dijkstra's Shortest Path Algorithm and Its Application [J]. Procedia Engineering, 2012, Vol. 29, pp. 1186-1190.
    • (2012) Procedia Engineering , vol.29 , pp. 1186-1190
    • Wang, S.X.1
  • 12
    • 72249086387 scopus 로고    scopus 로고
    • An optimal-time algorithm for shortest paths on realistic polyhedra [J]
    • Y. Schreiber. An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra [J]. Discrete & Computational Geometry, 2010, Vol. 43 (1), pp. 21-53.
    • (2010) Discrete & Computational Geometry , vol.43 , Issue.1 , pp. 21-53
    • Schreiber, Y.1
  • 13
    • 84901851869 scopus 로고    scopus 로고
    • Path optimization study for vehicles evacuation based on dijkstra algorithm [J]
    • Y. Z. Chen, S. F. Shen. Path Optimization Study for Vehicles Evacuation based on Dijkstra Algorithm [J]. Procedia Engineering, 2014, Vol. 71.
    • (2014) Procedia Engineering , vol.71
    • Chen, Y.Z.1    Shen, S.F.2
  • 14
    • 84901855875 scopus 로고    scopus 로고
    • Dijkstra's algorithm and L-concave function maximization [J]
    • K. Murota, A. Shioura. Dijkstra's algorithm and L-concave function maximization [J]. Mathematical Programming, 2014, Vol. 145 (1-2), pp. 163-177.
    • (2014) Mathematical Programming , vol.145 , Issue.1-2 , pp. 163-177
    • Murota, K.1    Shioura, A.2


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