BIONOMIC ALGORITHM FOR SHORTEST PATH FIRST
Azam Khan, Saira Beg, Faraz Ahsan, Sajjad Mohsin · 2011
In this paper we propose the idea of using Bionomic Algorithm (BA) for the shortest path finding problem. SPF is a very important issue associated with many other tasks like network routing and graph/map analysis etc. Different techniques have been used for solving the SPF problem, some of them being Dijkstra Algorithm, Floyd Algorithm, Genetic Algorithm, Tabu Search etc. The choice of algorithm for any specific problem depends upon the complex tradeoffs between complexity, performance etc. Our aim is to use type 3 heuristics algorithm for SPF. Simulations are carried out for BA algorithm and Dijkstra algorithm using MATLAB.