DocumentCode
2690033
Title
Experimental analysis of dynamic migration intervals on 0/1 knapsack problems
Author
Hong, Tzung-Pei ; Lin, Wen-Yang ; Liu, Shu-Min ; Lin, Jiann-Horng
Author_Institution
Nat. Univ. of Kaohsiung, Kaohsiung
fYear
2007
fDate
25-28 Sept. 2007
Firstpage
1163
Lastpage
1167
Abstract
In this paper, the effects of adapting the migration intervals on the performance and solution quality of dynamic multi-population genetic algorithms (MGAs) are investigated. An adaptive scheme to evolve the appropriate migration intervals for MGAs is presented. An adaptive multi-population genetic algorithm which can adjust the migration intervals is proposed. Experiments on the 0/1 knapsack problem are conducted to show the effectiveness of the proposed approach. The experimental results have illustrated the effectiveness of the self-adaptation of migration intervals for MGAs.
Keywords
dynamic programming; genetic algorithms; knapsack problems; dynamic migration interval; dynamic multipopulation genetic algorithms; knapsack problem; Evolutionary computation;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
Conference_Location
Singapore
Print_ISBN
978-1-4244-1339-3
Electronic_ISBN
978-1-4244-1340-9
Type
conf
DOI
10.1109/CEC.2007.4424601
Filename
4424601
Link To Document