Multipopulation Genetic Algorithm Based on GPU for Solving TSP Problem

10Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A GPU-based Multigroup Genetic Algorithm was proposed, which parallelized the traditional genetic algorithm with a coarse-grained architecture island model. The original population is divided into several subpopulations to simulate different living environments, thus increasing species richness. For each subpopulation, different mutation rates were adopted, and the crossover results were optimized by combining the crossover method based on distance. The adaptive mutation strategy based on the number of generations was adopted to prevent the algorithm from falling into the local optimal solution. An elite strategy was adopted for outstanding individuals to retain their superior genes. The algorithm was implemented with CUDA/C, combined with the powerful parallel computing capabilities of GPUs, which greatly improved the computing efficiency. It provided a new solution to the TSP problem.

Cite

CITATION STYLE

APA

Wang, B., Zhang, H., Nie, J., Wang, J., Ye, X., Ergesh, T., … Wang, W. (2020). Multipopulation Genetic Algorithm Based on GPU for Solving TSP Problem. Mathematical Problems in Engineering, 2020. https://doi.org/10.1155/2020/1398595

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free