A Comparative Analysis among Three Different Shortest Path-finding Algorithms

The purpose of shortest route algorithms is to find a path having fewest weights between any two vertices along the edges. However, the shortest path problem may take many different forms, requiring the employment of many algorithms. In this paper, three of the shortest path finding algorithms are i...

Full description

Saved in:
Bibliographic Details
Published in2022 3rd International Conference for Emerging Technology (INCET) pp. 1 - 4
Main Authors Aziz, Anusha, Tasfia, Sheikh, Akhtaruzzaman, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 27.05.2022
Subjects
A Search
ACO
Ant colony optimization
Complexity theory
Dijkstra
Employment
Search problems
Shortest Path
Shortest path problem
Software
Software algorithms
Online AccessGet full text
DOI10.1109/INCET54531.2022.9824074

Cover

More Information
Summary:The purpose of shortest route algorithms is to find a path having fewest weights between any two vertices along the edges. However, the shortest path problem may take many different forms, requiring the employment of many algorithms. In this paper, three of the shortest path finding algorithms are implemented and a comparative analysis is conducted among the three algorithms which are A* Search, Ant Colony Optimization (ACO), and Dijkstra. The parameters considered for comparative analysis are Run-time, Diagonal Movement, Complexity, Distance, Number of turns, and Number of visited nodes that are not in the path. For all the cases A* algorithm shows the best results except for the run-time.
DOI:10.1109/INCET54531.2022.9824074