DocumentCode
3548698
Title
Hierarchical two-population genetic algorithm
Author
Martikainen, Jarno ; Ovaska, Seppo J.
Author_Institution
Inst. of Intelligent Power Electron., Helsinki Univ. of Technol., Espoo, Finland
fYear
2005
fDate
28-30 June 2005
Firstpage
91
Lastpage
98
Abstract
In this paper, an analysis of a hierarchical two-population genetic algorithm (2PGA) is presented. Our hierarchical 2PGA composes of two populations that constitute of similarly fit chromosomes. The smaller population, i.e. the elite population, consists of the best chromosomes, whereas the larger population contains less fit chromosomes. The populations have different characteristics, such as size and mutation probability, based on the fitness of the chromosomes in these populations. The performance of our 2PGA is compared to that of a single population genetic algorithm (SPGA). Because the 2PGA has multiple parameters, the significance and the effect of the parameters is also studied. Experimental results show that the 2PGA outperforms the SPGA very reliably without increasing the amount of fitness function evaluations.
Keywords
genetic algorithms; probability; 2PGA; SPGA; elite population; hierarchical two-population genetic algorithm; mutation probability; similarly fit chromosome; single population genetic algorithm; Algorithm design and analysis; Biological cells; Computational modeling; Concurrent computing; Evolutionary computation; Genetic algorithms; Genetic mutations; Parallel processing; Power electronics; Uniform resource locators;
fLanguage
English
Publisher
ieee
Conference_Titel
Soft Computing in Industrial Applications, 2005. SMCia/05. Proceedings of the 2005 IEEE Mid-Summer Workshop on
Print_ISBN
0-7803-8942-5
Type
conf
DOI
10.1109/SMCIA.2005.1466954
Filename
1466954
Link To Document