Article · June 25, 2013
A Review And Evaluations Of Shortest Path Algorithms
Magzhan Kairanbay, Hajar Mat Jani
Abstract
Abstract: Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing the overall costs of setting up computer networks. New technologies such as map-related systems are also applying the shortest path problem. This paper’s main objective is to evaluate the Dijkstra’s Algorithm, Floyd-Warshall Algorithm, Bellman-Ford Algorithm, and Genetic Algorithm (GA) in solving the shortest path problem. A short review is performed on the various types of shortest path algorithms. Further explanations and implementations of the algorithms are illustrated in graphical forms to show how each of the algorithms works. A framework of the GA for finding optimal solutions to the shortest path problem is presented. The results of evaluating the Dijkstra’s, Floyd-Warshall and Bellman-Ford algorithms along with their time complexity conclude the paper.
More by Magzhan Kairanbay
- End-to-End VITS Outperforms Two-Stage Tacotron 2 Synthesis for Kazakh: A Comparative Study on a New Multi-Domain Speech CorpusAlgorithms · 2026
- Vision-Language Temporal Analysis for Illegal Waste Dumping Detection in Surveillance VideosIEEE/CVF Winter Conference on Applications of Computer Vision Workshops · 2026 · Citations: 2
- Real-Time Multi-Parameter Petroleum Coke Quality Monitoring Using Computer Vision and Integrated Anomaly Detection for Aluminum Smelting OperationsInternational Conference on Computer and Applications · 2025
- Multi-Dimensional Tail Classification in Procurement Spend Analysis: A Data-Driven Approach to Strategic Sourcing OptimizationInternational Conference on Computer and Applications · 2025