Analysis Urban Traffic Vehicle Routing Based on Dijkstra Algorithm Optimization

[1]  Trong-The Nguyen,et al.  A Hybrid Improved MVO and FNN for Identifying Collected Data Failure in Cluster Heads in WSN , 2020, IEEE Access.

[2]  Hong-Gyoo Sohn,et al.  Infiltration Route Analysis Using Thermal Observation Devices (TOD) and Optimization Techniques in a GIS Environment , 2010, Sensors.

[3]  John N. Tsitsiklis,et al.  Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs , 1993, Oper. Res..

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  Hajar Mat Jani,et al.  A Review And Evaluations Of Shortest Path Algorithms , 2013 .

[6]  Trong-The Nguyen,et al.  Hybrid Particle Swarm Optimization with Artificial Bee Colony Optimization for Topology Control Scheme in Wireless Sensor Networks , 2015 .

[7]  Trong-The Nguyen,et al.  A hybridized parallel bats algorithm for combinatorial problem of traveling salesman , 2020, J. Intell. Fuzzy Syst..

[8]  Andrej Babinec,et al.  Modelling of Mechanical and Mechatronic Systems MMaMS 2014 Path planning with modified A star algorithm for a mobile robot , 2014 .

[9]  Xinhui Wang,et al.  Speeding up the Dreyfus–Wagner algorithm for minimum Steiner trees , 2007, Math. Methods Oper. Res..

[10]  Trong-The Nguyen,et al.  Identification Failure Data for Cluster Heads Aggregation in WSN Based on Improving Classification of SVM , 2020, IEEE Access.

[11]  Jay Lee,et al.  On Applying Viewshed Analysis for Determining Least-Cost Paths on Digital Elevation Models , 1998, Int. J. Geogr. Inf. Sci..

[12]  Baruch Awerbuch,et al.  Approximate distributed Bellman-Ford algorithms , 1994, IEEE Trans. Commun..