Analysis of Dijkstra's Algorithm and A Algorithm in Shortest Path Problem

Finding the shortest path in direction effective is essential. To solve this shortest path problem, we usually using Dijkstra or A* algorithm. These two algorithms are often used in routing or road networks. This paper's objective is to compare those two algorithms in solving this shortest path...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1566; no. 1; pp. 12061 - 12067
Main Authors Rachmawati, Dian, Gustin, Lysander
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.06.2020
Subjects
Algorithms
Dijkstra's algorithm
Physics
Roads & highways
Route planning
Online AccessGet full text
ISSN1742-6588
1742-6596
1742-6596
DOI10.1088/1742-6596/1566/1/012061

Cover

More Information
Summary:Finding the shortest path in direction effective is essential. To solve this shortest path problem, we usually using Dijkstra or A* algorithm. These two algorithms are often used in routing or road networks. This paper's objective is to compare those two algorithms in solving this shortest path problem. In this research, Dijkstra and A* almost have the same performance when using it to solve town or regional scale maps, but A* is better when using it to solve a large scale map.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
1742-6596
DOI:10.1088/1742-6596/1566/1/012061