A hybrid approach to enhanced genetic algorithm for route optimization problems

Abstract

Shortest path problem has emerged to be one of the significant areas of research and there are various algorithms involved in it. One of the successful optimization techniques is genetic algorithm (GA). This paper proposes an efficient hybrid genetic algorithm where initially we use a map reduction technique to the graph and then find the shortest path using the conventional genetic algorithm with an improved crossover operator. On comparing this hybrid algorithm with other algorithms, it has been detected that the performance of the modified genetic algorithm is better as comparison to the other methods in terms of various metrics used for the evaluation.