The Community for Technology Leaders
2012 Conference on Technologies and Applications of Artificial Intelligence (TAAI) (2012)
Tainan
Nov. 16, 2012 to Nov. 18, 2012
ISSN: 2376-6816
ISBN: 978-1-4673-4976-5
pp: 338-343
ABSTRACT
Multipopulation Genetic Algorithms (MGAs) are island model genetic algorithms composed of spatially semi-isolated sub-populations, each evolving in parallel by its own pace and occasionally interacting with its neighborhoods by interchanging (usually good) individuals, called migration. Since the migration process is the kernel mechanism of MGAs for preventing premature convergence, many previous works have been devoted to the design of good migration schemes, including migration policy, migration interval, and migration rate, but very few work focusing on adaptive aspect of the migration schemes. In this study, we revisit this problem by inspecting the design of adaptive migration schemes from two perspectives, fitness-based, i.e., favoring the solution quality, or diversity-based, i.e., sustaining population diversity, and thereby we propose two new adaptive migration schemes, one is fitness-based and the other is diversity-based. A preliminary experiment on 0/1 knapsack problem shows that both of the new approaches are better than our previous methods, and the diversity-based approach is more effective than the fitness-based approach.
INDEX TERMS
genetic algorithms, knapsack problems
CITATION

W. Lin, T. Hong, S. Liu and J. Lin, "Revisiting the Design of Adaptive Migration Schemes for Multipopulation Genetic Algorithms," 2012 Conference on Technologies and Applications of Artificial Intelligence(TAAI), Tainan, Taiwan Taiwan, 2013, pp. 338-343.
doi:10.1109/TAAI.2012.41
85 ms
(Ver 3.3 (11022016))