Performance Evaluation of Bionomic Algorithm (BA) in Comparison with Genetic Algorithm (GA) for Shortest Path Finding Problem
This paper presents performance evaluation of Bionomic Algorithm (BA) for Shortest Path Finding (SPF) problem as compared with the performance of Genetic Algorithm (GA) for the same problem. SPF is a classical problem having many applications in networks, robotics and electronics etc. SPF problem has been solved using different algorithms such as Dijkstras Algorithm, Floyd including GA, Neural Network (NN), Tabu Search (TS), and Ant Colony Optimization (ACO) etc. We have employed Bionomic Algorithm for solving the SPF problem and have given the performance comparison of BA vs. GA for the same problem. Simulation results are presented at the end which is carried out using MATLAB.
Keywords: Bionomic Algorithm (BA), Genetic Algorithm (GA), Shortest Path First (SPF).
Download Full-Text
ABOUT THE AUTHORS
Saira Beg
Research Associate
Azam Khan
Research Associate
Umar Nauman
Assistant Professor
Sajjad Mohsin
Professor and Dean of Ciit
Saira Beg
Research Associate
Azam Khan
Research Associate
Umar Nauman
Assistant Professor
Sajjad Mohsin
Professor and Dean of Ciit
