Title: Improved Dijkstra algorithm for shortest path in urban traffic net
Abstract: The paper proposed a bidirectional search improved Dijkstra algorithm based on the characteristic of the urban road network and Dijkstra algorithm.Result showed that the improved Dijkstra algorithm could reduce the searching range by 15% ~ 25%,the more the nodes are,the more obvious the reduction.The improved algorithm could improve the real-time in path searching.
Publication Year: 2013
Publication Date: 2013-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot