Research article · Nov 2014
Research articlePublished Oct 2014
Dijkstra’s Shortest Path Algorithm for Road Network
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
Shortest Path problems are inevitable in road network applications such as city emergency handling and drive guiding system. Basic concepts of network analysis in connection with traffic issues are explored. The traffic condition among a city changes from time to time and there are usually huge amounts of requests occur, it needs to find the solution quickly. The above problems can be rectified through shortest paths by using the Dijkstra’s Algorithm. The main objective is the low cost of the implementation. The shortest path problem is to find a path between two vertices (nodes) on a given graph, such that the sum of the weights on its constituent edges is minimized. This problem has been intensively investigated over years, due to its extensive applications in graph theory, artificial intelligence, computer network and the design of transportation systems. The classic Dijkstra’s algorithm was designed to solve the singlesource shortest path problem for a static graph. It works starting from the source node and calculating the shortest path on the whole network. Noting that an upper bound of the distance between two nodes can be evaluated in advance on the given transportation network. In order to solve the problem, we have been implemented shortest path for road network by using Applets in a programing language java. Software required for this application is jdk1.7.0_01.
Ask about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · May 2015
Shortest Path Finding Using a Star Algorithm and Minimum weight Node First Principle
Research article · Mar 2014
Packet classification based on priority with shortest path algorithm
Research article · Apr 2013
Landmark Based Shortest Path Detection by Using A* and Haversine Formula
Research article · Oct 2013
Coupled Shortest Fuzzy C-Means Clustering Algorithm (CS-FCM) In Mixed Dataset
More from this journal
The newest in International Journal of Innovative Research in Computer and Communication Engineering.
Commentary · 2023
Computer Vision and Pattern Recognition
Commentary · 2023
Computer Network and Network Optimization
Perspective · 2023
Cloud Computing and Big Data Analysis
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalInternational Journal of Innovative Research in Computer and Communication Engineering
- SubjectComputer Science & IT
- SubjectEngineering
- SubjectSocial Sciences & Humanities
- BylineArticles whose byline prints “K.Rohila”
- BylineArticles whose byline prints “P.Gouthami”
- BylineArticles whose byline prints “Priya M”
