Optimal Route Finder using Genetic Algorithm

The primary operation requirement in a large area network is a query of shortest distance. Finding the shortest route from source to destination is one of the major problems faced in the network. This paper provides an implementation of solving one of the problems of finding a shortest route using a algorithm known as Genetic algorithm. Genetic algorithms are the evolutionary techniques for finding the fittest gene amongst all the combination of chromosomes using crossover and mutations over the chromosomes. The purpose is to find the most approximate solution that gives us the least distance, which is the shortest route for traversing the cities. This problem a salesman has to traverse n number of cities in such way that it gives a 'uni' directed graph and each city is visited only once. We accomplish this by carrying out the algorithm through generating a fitness formula and with the help of genetic operators like selection, crossover and mutation.