A Comparative Analysis of Selection Schemes of Genetic Algorithm to Find an Optimum and Reliable Route in Wired Networks

The single source shortest path problem is one of the most studied problems in algorithmic graph theory. Single Source Shortest Path is the problem in which we have to find shortest paths from a source vertex v to all other vertices in the graph. And we incorporate this problem in the wired network for finding the reliable route between the nodes of wired network. A number of algorithms have been proposed for this problem. Most of the algorithms for this problem have evolved around the Dijkstra’s algorithm. This paper gives the description of a genetic algorithm with best suitable selection method that can be used to find an optimal and reliable route between nodes of a wired network so that the average end to end time of routing packets from one node to the other node can be minimized. In this paper, we are going to do comparative analysis of the selection methods of Genetic Algorithm to solve this problem which is an optimization algorithm based on evolutionary ideas of natural selection and genetics.