期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2011
卷号：8
期号：6
出版社：IJCSI Press
摘要：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.
关键词：Bionomic Algorithm (BA); Genetic Algorithm (GA); Shortest Path First (SPF).
