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

  • Rafael R. Silva
  • Heitor S. Lopes
  • Carlos R. Erig Lima
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4431)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahn, C., Ramakrishna, R.: Elitism-based compact genetic algorithms. IEEE Trans. Evolutionary Computation 7, 367–385 (2003)CrossRefGoogle Scholar
  2. 2.
    Becker, J., Hartenstein, R.: Configware and morphware going mainstream. J. Systems Architecture 49, 127–142 (2003)CrossRefGoogle Scholar
  3. 3.
    Gallagher, J., Vigraham, S., Kramer, G.: A family of compact genetic algorithms for intrinsic evolvable hardware. IEEE Trans. Evolutionary Computation 8, 111–126 (2004)CrossRefGoogle Scholar
  4. 4.
    Goldberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, Reading (1989)MATHGoogle Scholar
  5. 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. 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
  7. 7.
    Lopes, H.S., Moritz, G.L.: A graph-based genetic algorithm for the multiple sequence alignment problem. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol. 4029, pp. 420–429. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 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

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Rafael R. Silva
    • 1
  • Heitor S. Lopes
    • 1
  • Carlos R. Erig Lima
    • 1
  1. 1.Bioinformatics Laboratory, Federal University of Technology Paraná (UTFPR), Av. 7 de setembro, 3165 80230-901, Curitiba (PR)Brazil

Personalised recommendations