USING GENETIC ALGORITHM TO MODEL THE SHORTEST PATH WITHIN TWENTY CITIES

In this era, the best problem solving method is needed in all field irrespective of the complexity or simplicity of the problem. Researchers and developers are doing their best to make software’s and machines more potent and intelligent. This is the advantage of artificial intelligent in developing solutions to searching algorithms that are potent and optimal. The most potent highly developed investigate method in Artificial Intelligence is the genetic algorithm. Genetic algorithm was developed to get best result to a known difficulty premised on inheritance, collection, crossover, mutation and further method. It has been proven that genetic algorithm is the most potent, impartial optimization method for analyzing a solution with large space. this research have been able to define what is genetic algorithm, how it differs from other existing traditional search optimization method, review of ten (10) traditional techniques of finding the best route in a given network. Also the design of genetic algorithm, it’s implementation on finding the best route within 20 cities (point) which is invariably the travelling salesman problem (TSP), and areas of application of application of genetic algorithms. The best route is invariably the shortest path.