Performance Analysis of Fault Tolerant Heuristic Algorithms for Determining Optimal
Karunakara Rai B1, Shantharama Rai C2

1Karunakara Rai B, Associate Professor, NMIT, Bengaluru, India.
2Shantharama Rai C, Professor, AJIET, Mangalore.

Manuscript received on 23 August 2019. | Revised Manuscript received on 05 September 2019. | Manuscript published on 30 September 2019. | PP: 1777-1781 | Volume-8 Issue-11, September 2019. | Retrieval Number: K17620981119/2019©BEIESP | DOI: 10.35940/ijitee.K1762.0981119
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: In this paper, the performance of different bio inspired algorithms are compared to obtain optimal path. Performance of different individual algorithms are analyzed for different topological weights. In networking, it is easy to find the route for static systems where once the optimal path is found, the same is used to communicate between two devices for a long time. Research has shown that it is difficult to find optimal paths for networks with dynamically changing network parameters. In this paper the focus is on performance of three fault tolerant heuristic routing algorithms for such networks. The simulation result shows that 60% of the time Ant Colony Optimization method outperformed Genetic and Beehive algorithms.
Keywords: Ant Colony Optimization, Beehive algorithm, Fault Tolerant, Genetic algorithm, Network topology.
Scope of the Article: Optimal Design of Structures