An Improved optimization Algorithm to Find Multiple Shortest Paths over Large Graph

The problem of finding the shortest path is a combinatorial well-studied optimization problem, this last decade and is a challenging task over large graphs. This article presents an improved optimization Genetic algorithm (IOGA) to solve the k shortest paths problem. Our algorithm based on the combination of the exact algorithm (Dijkstra) and metaheuristic algorithm (Genetic algorithm-GA) is proposed to return the k shortest optimal paths on graph in large-scale routing problems. Our empirical results show that the proposed algorithm surpasses and runs faster than Dijkstra’s algorithm and gives one or more paths,, while Dijkstra gives only one path.