Efficient hierarchical hybrids parallel genetic algorithm for shortest path routing

The major constraint in any routing is the time and smallest path reduced time consumption. Genetic algorithm is an efficient way to produce shortest path routing due to its nature. This paper presents an algorithm based on hierarchical hybrids parallel genetic algorithm for the shortest path routing. The algorithm is the hybrid of coarse-grained genetic algorithm and fine grained genetic algorithm and reduces the communication overhead present in the existing algorithm. The algorithm uses the worst replace best migration strategy to replace the genes. The simulation result shows that the algorithm outperforms the serial genetic algorithm due to parallelism and outperforms coarse-grained genetic algorithm in terms of communication.