A Parallel Genetic Algorithm for Solving Traveling Salesman Problem
Yang Chang-ging · Jisuanji fangzhen · 2005
Genetic Algorithm (GA) is an effective searching algorithm based on genetic mechanism of natural colony, consulting simultaneously several points in searching space, GA can reduce the possibility of converging on local minimum and enhance the processing parallelization. Therefore, parallel genetic algorithm(PGA) can be used in studying the solution of typical instance about combinatorial optimization—TSP problem. In this paper, we introduce the principles of PGA and make use of PGA to TSP. The results of experiments show that the new parallel genetic algorithm is practical and efficient.