Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA)
| Main Authors: | Buthainah Fahran Al-Dulaimi, Hamza A. Ali |
|---|---|
| Format: | Article Journal |
| Bahasa: | eng |
| Terbitan: |
, 2008
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/1063140 |
Daftar Isi:
- 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.