A New Mutation Operator for the Elitism-Based Compact Genetic Algorithm

Authors:
Rafael R. Silva;Heitor S. Lopes;Carlos R. Erig Lima
Affiliations:
Bioinformatics Laboratory, Federal University of Technology Paraná (UTFPR), Av. 7 de setembro, 3165 80230-901, Curitiba (PR), Brazil;Bioinformatics Laboratory, Federal University of Technology Paraná (UTFPR), Av. 7 de setembro, 3165 80230-901, Curitiba (PR), Brazil;Bioinformatics Laboratory, Federal University of Technology Paraná (UTFPR), Av. 7 de setembro, 3165 80230-901, Curitiba (PR), Brazil
Venue:
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Year:
2007

Citing 5
Cited 1

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Configware and morphware going mainstream

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Reconfigurable systems
A graph-based genetic algorithm for the multiple sequence alignment problem

ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Elitism-based compact genetic algorithms

IEEE Transactions on Evolutionary Computation
A family of compact genetic algorithms for intrinsic evolvable hardware

IEEE Transactions on Evolutionary Computation

A Compact Genetic Algorithm with Elitism and Mutation Applied to Image Recognition

ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Compact Genetic Algorithm (CGA) is a genetic algorithm specially devised to meet the tight restrictions of hardware-based implementations. We propose a new mutation operator for an elitism-based CGA. The performance of this algorithm, named emCGA, was tested using a set of algebraic functions for optimization. The optimal mutation rate found for high-dimensionality functions is around 0.5%, and the low the dimension of the problem, the less sensitive is emCGA to the mutation rate. The emCGA was compared with other two similar algorithms and demonstrated better tradeoff between quality of solutions and convergence speed. It also achieved such results with smaller population sizes than the other algorithms.