An Evaluation of the Dijkstra's Algorithm, Floyd's Algorithm and Ant Colony Optimization
Year: 2025
Type: article
Abstract: Travel is the movement of people between distant geographical locations. It can assist in enhancing our well-being, increasing our understanding, socializing with new individuals, relaxing and unwinding, seeking adventure, creating memories, improving mental and physical health, and immersing ourselves in different cultures. In this paper, we briefly explain the shortest path and their types applicable in practical life. The shortest path problem is a flexible and crucial instrument in different areas, facilitating effective route planning, network optimization, and resource distribution. There are many popular algorithms for solving the shortest distance path problem and its variations. We discuss how to create the most efficient route and introduce Dijkstra's algorithm, Floyd's algorithm, and Ant Colony Optimization to decrease the overall path expense, which could be distance, time, or another factor for the given scenario. We use two scenarios and evaluate Dijkstra's algorithm, Floyd's algorithm, and Ant Colony Optimization to determine the shortest route in practical situations to enhance efficiency in solving the identical issue.
Authors: A J Khan, Nikita Dewangan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4409789891