@article{(Open Science Index):https://publications.waset.org/pdf/6555, title = {Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA)}, author = {Buthainah Fahran Al-Dulaimi and Hamza A. Ali}, country = {}, institution = {}, abstract = {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. }, journal = {International Journal of Mathematical and Computational Sciences}, volume = {2}, number = {2}, year = {2008}, pages = {123 - 129}, ee = {https://publications.waset.org/pdf/6555}, url = {https://publications.waset.org/vol/14}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 14, 2008}, }