ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Hybrid evolutionary algorithms for large scale continuous problems
Full text PdfPdf (611 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
POSTER SESSION: Track 9: genetic algorithms table of contents
Pages: 1863-1864  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Antonio LaTorre  Universidad Politécnica de Madrid, Madrid, Spain
José María Peña  Universidad Politécnica de Madrid, Madrid, Spain
Santiago Muelas  Universidad Politécnica de Madrid, Madrid, Spain
Manuel Zaforas  Universidad Politécnica de Madrid, Madrid, Spain
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 34,   Citation Count: 0
Additional Information:

abstract   references   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/1569901.1570205
What is a DOI?

ABSTRACT

Evolutionary Algorithms (EAs) are powerful metaheuristics that can be applied to almost any optimization problem. However, different Evolutionary Algorithms own different search capabilities that make them more suitable for one or another optimization problem. Furthermore, the combination of several EAs can boost the performance of individual approaches. In this paper we try to exploit the benefits of the combination of several evolutionary approaches by means of a Hybrid Evolutionary Algorithm, where the participation of each individual algorithm on the overall process is dynamically adjusted through its execution. Two different strategies to perform this adjustment are proposed: one with a constant global population size and another one with variable global population size. Experimental results demonstrate that Hybrid Evolutionary Algorithms outperform the individual ones and that the dynamic strategy with variable population size obtains better results on most of the proposed functions.


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
C. Grosan and A. Abraham. Hybrid evolutionary algorithms: Methodologies, architectures, and reviews. In Hybrid Evolutionary Algorithms, volume 75 of Studies in Computational Intelligence, pages 1--17. Springer-Verlag GmbH, 2007.
 
2
A. LaTorre, J.M. Peña, V. Robles, and P. de Miguel. Supercomputer scheduling with innovative evolutionary techniques. In Meta-heuristics for Scheduling: Distributed Computing Environments,volume 146 of Studies in Computational Intelligence. Springer Verlag, Germany, 2008.

Collaborative Colleagues:
Antonio LaTorre: colleagues
José María Peña: colleagues
Santiago Muelas: colleagues
Manuel Zaforas: colleagues