Quasi-parallel genetic algorithms with different communication topologies
Guan Wang, Degang Wu, Kwok Yip Szeto · 2011
Systematic testing of parallel genetic algorithm defined on simple topologies such as ring, band, and fully connect graph are made with two benchmark problems, the 0-1 Knapsack Problem and the Weierstrass function. With fixed communication rule between sub-populations, our numerical results indicate that the band configuration is superior to other topologies tested. A heuristic understanding in terms of the compromise between exploitation and exploration in the solution space is suggested.