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 |
| ctrlnum |
1063140 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><creator>Buthainah Fahran Al-Dulaimi</creator><creator>Hamza A. Ali</creator><date>2008-02-28</date><description>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.</description><identifier>https://zenodo.org/record/1063140</identifier><identifier>10.5281/zenodo.1063140</identifier><identifier>oai:zenodo.org:1063140</identifier><language>eng</language><relation>doi:10.5281/zenodo.1063139</relation><relation>url:https://zenodo.org/communities/waset</relation><rights>info:eu-repo/semantics/openAccess</rights><rights>https://creativecommons.org/licenses/by/4.0/legalcode</rights><subject>Genetic algorithms</subject><subject>traveling salesman problem solving</subject><subject>optimization.</subject><title>Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA)</title><type>Journal:Article</type><type>Journal:Article</type><recordID>1063140</recordID></dc>
|
| language |
eng |
| format |
Journal:Article Journal Journal:Journal |
| author |
Buthainah Fahran Al-Dulaimi Hamza A. Ali |
| title |
Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA) |
| publishDate |
2008 |
| topic |
Genetic algorithms traveling salesman problem solving optimization |
| url |
https://zenodo.org/record/1063140 |
| contents |
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. |
| id |
IOS16997.1063140 |
| institution |
ZAIN Publications |
| institution_id |
7213 |
| institution_type |
library:special library |
| library |
Cognizance Journal of Multidisciplinary Studies |
| library_id |
5267 |
| collection |
Cognizance Journal of Multidisciplinary Studies |
| repository_id |
16997 |
| subject_area |
Multidisciplinary |
| city |
Stockholm |
| province |
INTERNASIONAL |
| shared_to_ipusnas_str |
1 |
| repoId |
IOS16997 |
| first_indexed |
2022-06-06T06:31:15Z |
| last_indexed |
2022-06-06T06:31:15Z |
| recordtype |
dc |
| _version_ |
1734909275537408000 |
| score |
17.610468 |