An Evaluation of the Dijkstra’s Algorithm, Floyd’s Algorithm and Ant Colony Optimization
A. J. Khan1, Nikita Dewangan2
1Dr. A. J. Khan, Associate Professor, Department of Mathematics, MATS University, Raipur (Chhattisgarh), India.
2Nikita Dewangan, Scholar, Department of Mathematics, MATS University, Raipur (Chhattisgarh), India.
Manuscript received on 29 March 2025 | First Revised Manuscript received on 07 April 2025 | Second Revised Manuscript received on 11 April 2025 | Manuscript Accepted on 15 April 2025 | Manuscript published on 30 April 2025 | PP: 38-42 | Volume-5 Issue-1, April 2025 | Retrieval Number: 100.1/ijam.A119805010425 | DOI: 10.54105/ijam.A1198.05010425
Open Access | Editorial and Publishing Policies | Cite | Zenodo | OJS | Indexing and Abstracting
© The Authors. Published by Lattice Science Publication (LSP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Travel is the movement of people between distant geographical locations. It can help enhance our well-being, increase our understanding, facilitate socialising with new individuals, promote relaxation and unwinding, encourage adventure, create memories, improve both mental and physical health, and immerse ourselves in different cultures. In this paper, we briefly explain the concept of the shortest path and its various types, which are applicable in practical life. The shortest path problem is a flexible and crucial tool in multiple areas, facilitating effective route planning, network optimisation, and resource allocation. 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 Optimisation to minimise the overall path expense, which could be measured by distance, time, or another factor in the given scenario. We use two scenarios to evaluate Dijkstra’s algorithm, Floyd’s algorithm, and Ant Colony Optimisation, determining the shortest route in practical situations to enhance efficiency in solving the same issue.
Keywords: Ant Colony Optimization, Dijkstra’s algorithm, Floyd’s algorithm, Shortest Path, Travelling.
Scope of the Article: Operation Research