ACM Home Page
Please provide us with feedback. Feedback
Improving the efficiency of the extended compact genetic algorithm
Full text PdfPdf (263 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
POSTER SESSION: Estimation of distribution algorithms posters table of contents
Pages 467-468  
Year of Publication: 2008
ISBN:978-1-60558-130-9
Authors
Thyago S.P.C. Duque  Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana Champaign, Urbana, IL, USA
David E. Goldberg  Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana Champaign, Urbana, IL, USA
Kumara Sastry  Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana Champaign, Urbana, IL, USA
Sponsors
ACM: Association for Computing Machinery
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 49,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1389095.1389181
What is a DOI?

ABSTRACT

Evolutionary Algorithms are largely used search and optimization procedures that, when properly designed, can solve intractable problems in tractable polynomial time. Efficiency enhancements are used to turn them from tractable to practical. In this paper we show preliminary results of two efficiency enhancements proposed for the Extended Compact Genetic Algorithm. First, a model building enhancement was used to reduce the complexity of the process from O($n^3$) to O($n^2$), speeding up the algorithm by 1000 times on a 4096 bits problem. Then, 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 draw the first steps toward a competent and efficient Genetic Algorithm.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
T. Duque, D. Goldberg, and K. Sastry. Enhancing the Efficiency of the ECGA. IlliGAL Report No. 2008006, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL, 2008.
 
2
 
3
 
4
G. Harik, F. Lobo, and K. Sastry. Linkage Learning via Probabilistc Modeling in the Extended Compact Genetic Algorithm (ECGA). Scalable Optimization via Probabilistic Modeling, Studies in Computational Inteligence, pages 39--61, 2006. (Also Illigal Report No. 99010).
5
 
6
K. Sastry, M. Pelikan, and D. Goldberg. Efficiency enhancement of estimation of distribution algorithms. Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, pages 161--185, 2006.


Collaborative Colleagues:
Thyago S.P.C. Duque: colleagues
David E. Goldberg: colleagues
Kumara Sastry: colleagues