TY  - JOUR
T1  - A Parallel Genetic Approach for the TSP
AU - Ettouhami, Aziz AU - Bouroumi, Abdelaziz AU - Jebari, Khalid 
JO  - International Journal of Soft Computing
VL  - 6
IS  - 3
SP  - 68
EP  - 74
PY  - 2011
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2011.68.74
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2011.68.74
KW  - traveling salesman problem
KW  -fuzzy clustering
KW  -unsupervised learning
KW  -genetic algorithms
KW  -Parallel algorithms
KW  -Parallel Virtual Machine (PVM)
AB  - The study deals with the efficiency of the parallel computation of the Travelling Salesman Problem (TSP) using the genetic algorithms and an unsupervised fuzzy clustering. First, the cities are classified by a clustering algorithms. Second, each class of cities is considered as a sub-tour TSP problem. A parallel genetic algorithms is used for solving the sub tour TSP problem. The main aim by creating the parallel algorithm is to accelerate the execution time of solving TSP. A connection method is proposed to connect the sub-tours into a global tour of whole cities. Furthermore, this global tour is resolved by genetic algorithms for cluster centers and a heuristic scheme. Experimental results, on Master Slave architecture with different TSP problemes show the efficacy of the proposed algorithm in parallelism exploitation.
ER  -