Enhanced Traveling Salesman Problem Solving By Genetic Algorithm Technique (Tspga)
Buthainah Fahran Al-Dulaimi, Hamza Ali · Zenodo (CERN European Organization for Nuclear Research) · 2008
The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form. A software system is proposed to determine the optimum route for a Traveling Salesman Problem using Genetic Algorithm technique. The system starts from a matrix of the calculated Euclidean distances between the cities to be visited by the traveling salesman and a randomly chosen city order as the initial population. Then new generations are then created repeatedly until the proper path is reached upon reaching a stopping criterion. This search is guided by a solution evaluation function.