A new model for evolving Evolutionary Algorithms is
proposed in this paper. The model is based on the
Linear Genetic Programming (LGP) technique. Every LGP
chromosome encodes an EA which is used for solving a
particular problem. Several Evolutionary Algorithms for
function optimisation, the Travelling Salesman Problem
and the Quadratic Assignment Problem are evolved by
using the considered model. Numerical experiments show
that the evolved Evolutionary Algorithms perform
similarly and sometimes even better than standard
approaches for several well-known benchmarking
problems.
%0 Journal Article
%1 oltean:2005:EC
%A Oltean, Mihai
%D 2005
%I MIT Press
%J Evolutionary Computation
%K algorithms algorithms, evolutionary evolving genetic linear programming,
%N 3
%P 387--410
%R doi:10.1162/1063656054794815
%T Evolving Evolutionary Algorithms Using Linear Genetic
Programming
%U http://www.ingentaconnect.com/content/mitpress/evco/2005/00000013/00000003/art00006
%V 13
%X A new model for evolving Evolutionary Algorithms is
proposed in this paper. The model is based on the
Linear Genetic Programming (LGP) technique. Every LGP
chromosome encodes an EA which is used for solving a
particular problem. Several Evolutionary Algorithms for
function optimisation, the Travelling Salesman Problem
and the Quadratic Assignment Problem are evolved by
using the considered model. Numerical experiments show
that the evolved Evolutionary Algorithms perform
similarly and sometimes even better than standard
approaches for several well-known benchmarking
problems.
@article{oltean:2005:EC,
abstract = {A new model for evolving Evolutionary Algorithms is
proposed in this paper. The model is based on the
Linear Genetic Programming (LGP) technique. Every LGP
chromosome encodes an EA which is used for solving a
particular problem. Several Evolutionary Algorithms for
function optimisation, the Travelling Salesman Problem
and the Quadratic Assignment Problem are evolved by
using the considered model. Numerical experiments show
that the evolved Evolutionary Algorithms perform
similarly and sometimes even better than standard
approaches for several well-known benchmarking
problems.},
added-at = {2008-06-19T17:46:40.000+0200},
author = {Oltean, Mihai},
biburl = {https://www.bibsonomy.org/bibtex/282da1f7132dd08169828d1b006b1c3b3/brazovayeye},
doi = {doi:10.1162/1063656054794815},
interhash = {094f7891372221f76f52374a26b877ff},
intrahash = {82da1f7132dd08169828d1b006b1c3b3},
issn = {1063-6560},
journal = {Evolutionary Computation},
keywords = {algorithms algorithms, evolutionary evolving genetic linear programming,},
month = {Fall},
notes = {http://mitpress.mit.edu/catalog/item/default.asp?ttype=4&tid=25
TSB, QAP
PMID: 16156929},
number = 3,
pages = {387--410},
publisher = {MIT Press},
size = {24 pages},
timestamp = {2008-06-19T17:48:53.000+0200},
title = {Evolving Evolutionary Algorithms Using Linear Genetic
Programming},
url = {http://www.ingentaconnect.com/content/mitpress/evco/2005/00000013/00000003/art00006},
volume = 13,
year = 2005
}