No abstract

The classical traveling salesman problem(TSP) is simple to state but difficult a problem to solve. TSP seeks to determine the total distance or cost of visiting (n-1) cities or points and returning to the starting city or point. In this research, the Genetic Algorithm (GA) technique is utilized for solving the problem of finding the optimal tour around the nine Niger Delta state capitals in Nigeria which is an example of a traveling salesman problem. The partially mapped(PMX) crossover operator and the inversion mutation operator techniques were employed due to their simplicity. Genetic algorithms are evolutionary techniques used in solving optimization problems according to the survival of the fittest. The method does not provide an optimal exact solution, rather, it gives an approximated result in time. Data required for the tour were obtained from an online google map website where the distances between the state capitals and their coordinates (longitude and latitudes) were obtained. The MATLAB software which is suitable for scientific computations was used in coding the results show that the BB algorithm yielded an optimal tour of 1351km with a cyclic tour of (X3,1), (X1,9), (X9,6), (X6,8), (X8,4), (X4,7), (X7,5), (X5,2), (X2,3) and then (X3,1) after nine (9) iterations. Solving using the genetic algorithm with the four genetic parameters population size(N), maximum generation(G), crossover probability (Pc), and mutation probability(Pn) were used and set to 30; 10; 0.8; and 0.1 respectively yielded an optimal path of (8476125398) which is with an optimal tour of 1124.0KMs. genetic algorithm yielded an improved result.