Adaptive mutation in genetic algorithms for shortest path routing problem

In a high evolving networks, with a high load of traffic, the classic shortest path routing algorithms are high time-consuming and it cause performance degradation for network if is impossible to generate the routing path in timely manner. This paper proposes an improved genetic algorithm to find the shortest path in networks, using an adaptive mutation operator, taking in consideration both on genotypic and phenotypic level. Experimental results show that the new mutation operator improves the performance of genetic algorithm, compared with standard genetic algorithm.