A New Mutation Operator for the Elitism-Based Compact Genetic Algorithm
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.
Unable to display preview. Download preview PDF.
- 5.Harik, G., Lobo, F., Goldberg, D.: The compact genetic algorithm. In: Proc. IEEE Conf. on Evolutionary Computation, pp. 523–528 (1998)Google Scholar
- 6.Krink, T., Filipic, B., Fogel, G., Thompsen, R.: Noisy optimization problems – a particular challenge for differential evolution? In: Proc. IEEE Conf. on Evolutionary Computation, pp. 332–339 (2004)Google Scholar
- 8.Moritz, G.L., Jory, C., Lopes, H.S., Erig Lima, C.R.: Implementation of a parallel algorithm for pairwise alignment using reconfigurable computing. In: Proc. IEEE Int. Conf. on Reconfigurable Computing and FPGAs, pp. 99–105 (2006)Google Scholar