![]() |
CiteULike | ![]() |
Group: Metaheuristics | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Evolutionary design of Evolutionary Algorithmsby: Laura Dioşan, Mihai Oltean
Genetic Programming and Evolvable Machines, Vol. 10, No. 3. (1 September 2009), pp. 263-306.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractAbstract Manual design of Evolutionary Algorithms (EAs) capable of performing very well on a wide range of problems is a difficult task. This is why we have to find other manners to construct algorithms that perform very well on some problems. One possibility (which is explored in this paper) is to let the evolution discover the optimal structure and parameters of the EA used for solving a specific problem. To this end a new model for automatic generation of EAs by evolutionary means is proposed here. The model is based on a simple Genetic Algorithm (GA). Every GA chromosome encodes an EA, which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization are generated by using the considered model. Numerical experiments show that the EAs perform similarly and sometimes even better than standard approaches for several well-known benchmarking problems.
BibTeX record
RIS record