A Multi-Group Parallel Genetic Algorithm for TSP

Genetic algorithm is an effective search algorithm based on the natural genetic mechanism.Because it takes into account a number of points,so it may reduce the convergence in the local minimum,and will increase the parallel processing.So the parallel genetic algorithm can be used to solve typical TSP problem.This paper presents an effective multi-group parallel algorithm for solving traveling salesman(TSP) problem.By using parallel genetic evolution,and making genetic information exchange between populations,the classical convergence problem will be solved.The experimental results show that the accuracy and quality of the method are better than that of the classical algorithms.