• Home
  • Search
  • Comparative Analysis of Shortest Path Algorithms
  • https://doi.org/10.36346/sarjet.2025.v07i05.002Copy DOI Icon

Comparative Analysis of Shortest Path Algorithms

Show More
  • Abstract
  • Literature Map
  • Similar Papers
Abstract

This paper is a comparative between classical, hybrid and heuristic shortest path algorithms. Shortest path algorithms are necessary in graph theory and has different applications in operations research, artificial intelligence, networking, and transportation. In dynamic or huge graphs, the deterministic correctness and limitations of classical algorithms such as Dijkstra's and Bellman-Ford have been investigated. The current research examined the flexibility and scalability of heuristic techniques like Ant Colony Optimization, A*, and Genetic Algorithms. Furthermore, examined the potential to improve and enhance the accuracy of hybrid algorithms that include characteristics from both categories has been studied. This work employs important evaluation standards, for instance, optimality, time complexity, and scalability, to inspect the theoretical underpinnings, practical applications, and performance compromises of each strategy.

Similar Papers
  • Conference Article
  • Citations9

A hybrid algorithm based on genetic algorithm and ant colony optimization for Traveling Salesman Problems

  • Dec 01, 2010
  • Chunxiang Wang +1
  • Research Article

From the Guest Editor—Special Cluster on Operations Research in Electrical and Computer Engineering

  • May 01, 2006
  • INFORMS Journal on Computing
  • John W Chinneck
  • Conference Article
  • Citations16

Scheduling jobs in computational grid using hybrid ACS and GA approach

  • Oct 01, 2014
  • Mustafa Muwafak Alobaedy +1
  • Research Article
  • Citations61

Application of Improved Multi-Objective Ant Colony Optimization Algorithm in Ship Weather Routing

  • Jan 12, 2021
  • Journal of Ocean University of China
  • Guangyu Zhang +4
  • Research Article
  • Citations41

An ant colony optimization algorithm for scheduling virtual cellular manufacturing systems

  • Jul 25, 2007
  • International Journal of Computer Integrated Manufacturing
  • K L Mak +3
  • Research Article
  • Citations30

Using Local Searches Algorithms with Ant Colony Optimization for the Solution of TSP Problems

  • Jan 01, 2018
  • Academic Journal of Nawroz University
  • Renas Asaad +1
  • Research Article
  • Citations3

SAT-GATv2: A Dynamic Attention-Based Graph Neural Network for Solving Boolean Satisfiability Problem

  • Jan 22, 2025
  • Electronics
  • Wenjing Chang +1
  • Research Article

Contributors

  • Feb 01, 2011
  • Operations Research
  • Sandro Bosio
  • Research Article

Contributors

  • Dec 01, 2010
  • Operations Research
  • Research Article
  • Citations1

Optimization Design Based On Self-Adapted Ant Colony and Genetic Mix Algorithm for Parameters of PID Controller

  • Jul 31, 2015
  • International Journal of Hybrid Information Technology
  • Xiao-Yu Wang
  • Research Article
  • Citations16

SENET: A novel architecture for IoT-based body sensor networks

  • Jan 01, 2020
  • Informatics in Medicine Unlocked
  • Zohre Arabi Bulaghi +3
  • Research Article
  • Citations3

Algorithm for the route’sformation of food raw materials procure-ment on the community territory taking into account the production conditions during emergency situations

  • Apr 10, 2023
  • Applied Aspects of Information Technology
  • Аnatoliy M Тryhuba +4
  • Conference Article

The Use of AI for Improving Energy Security: Exploring the Risks and Opportunities of the Deployment of AI Applications in the Electricity System

  • Sep 10, 2024
  • Ismael Arciniegas Rueda +2
  • Conference Article
  • Citations3

A Coevolutionary Model Based on Dynamic Combination of Genetic Algorithm and Ant Colony Algorithm

  • Jan 01, 2005
  • Ming Chen +1
  • Research Article

Phase unwrapping based on fusion of ant colony and genetic algorithms

  • Jun 03, 2021
  • IET Conference Proceedings
  • X Chen +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.