Enhancing the Efficiency of the ECGA

  • Thyago S. P. C. Duque
  • David E. Goldberg
  • Kumara Sastry
Conference paper

DOI: 10.1007/978-3-540-87700-4_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5199)
Cite this paper as:
Duque T.S.P.C., Goldberg D.E., Sastry K. (2008) Enhancing the Efficiency of the ECGA. In: Rudolph G., Jansen T., Beume N., Lucas S., Poloni C. (eds) Parallel Problem Solving from Nature – PPSN X. PPSN 2008. Lecture Notes in Computer Science, vol 5199. Springer, Berlin, Heidelberg

Abstract

In this paper we show preliminary results of two efficiency enhancements proposed for Extended Compact Genetic Algorithm. First, a model building enhancement was used to reduce the complexity of the process from O(n3) to O(n2), speeding up the algorithm by 1000 times on a 4096 bits problem. Then, a local-search hybridization was used to reduce the population size by at least 32 times, reducing the memory and running time required by the algorithm. These results are the first steps toward a competent and efficient Genetic Algorithm.

Keywords

Estimation of Distribution Algorithms ECGA Model Building Efficiency Enhancement 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Thyago S. P. C. Duque
    • 1
  • David E. Goldberg
    • 1
  • Kumara Sastry
    • 1
  1. 1.Illinois Genetic Algorithms LaboratoryUniversity of Illinois at Urbana ChampaignUrbanaUSA

Personalised recommendations