%0 Journal Article
	%A Buthainah Fahran Al-Dulaimi and  Hamza A. Ali
	%D 2008
	%J International Journal of Mathematical and Computational Sciences
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 14, 2008
	%T Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA)
	%U https://publications.waset.org/pdf/6555
	%V 14
	%X 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.

	%P 123 - 129