%0 Conference Paper %1 zvada:2004:eurogp %A Zvada, Szilvia %A Vanyi, Robert %B Genetic Programming 7th European Conference, EuroGP 2004, Proceedings %C Coimbra, Portugal %D 2004 %E Keijzer, Maarten %E O'Reilly, Una-May %E Lucas, Simon M. %E Costa, Ernesto %E Soule, Terence %I Springer-Verlag %K algorithms, genetic programming %P 208--219 %T Improving Grammer Based Evolution Algorithms via Attributed Derivation Trees %U http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3003&spage=208 %V 3003 %X Using Genetic Programming difficult optimisation problems can be solved, even if the candidate solutions are complex objects. In such cases, it is a costly procedure to correct or replace the invalid individuals that may appear during the evolutionary process. Instead of such post-processing, context-free grammars can be used to describe the syntax of valid solutions, and the algorithm can be modified to work on derivation trees, such that it does not generate invalid individuals. Although tree operators have the advantage of good parameterizability, it is not trivial to construct them correctly and efficiently. An existing method for derivation tree evolution and its extension towards attributed derivation trees are discussed. As the result of this extension the operators are not only faster but they are easy to parameterise, moreover the algorithm is better guided, thus it can converge faster. %@ 3-540-21346-5

@inproceedings{zvada:2004:eurogp, abstract = {Using Genetic Programming difficult optimisation problems can be solved, even if the candidate solutions are complex objects. In such cases, it is a costly procedure to correct or replace the invalid individuals that may appear during the evolutionary process. Instead of such post-processing, context-free grammars can be used to describe the syntax of valid solutions, and the algorithm can be modified to work on derivation trees, such that it does not generate invalid individuals. Although tree operators have the advantage of good parameterizability, it is not trivial to construct them correctly and efficiently. An existing method for derivation tree evolution and its extension towards attributed derivation trees are discussed. As the result of this extension the operators are not only faster but they are easy to parameterise, moreover the algorithm is better guided, thus it can converge faster.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Coimbra, Portugal}, author = {Zvada, Szilvia and Vanyi, Robert}, biburl = {https://www.bibsonomy.org/bibtex/2564361868c4b325783e930b0602ff789/brazovayeye}, booktitle = {Genetic Programming 7th European Conference, EuroGP 2004, Proceedings}, editor = {Keijzer, Maarten and O'Reilly, Una-May and Lucas, Simon M. and Costa, Ernesto and Soule, Terence}, interhash = {71bee07eae17091c17efbf2d096456fd}, intrahash = {564361868c4b325783e930b0602ff789}, isbn = {3-540-21346-5}, keywords = {algorithms, genetic programming}, month = {5-7 April}, notes = {Part of \cite{keijzer:2004:GP} EuroGP'2004 held in conjunction with EvoCOP2004 and EvoWorkshops2004}, organisation = {EvoNet}, pages = {208--219}, publisher = {Springer-Verlag}, publisher_address = {Berlin}, series = {LNCS}, timestamp = {2008-06-19T17:56:01.000+0200}, title = {Improving Grammer Based Evolution Algorithms via Attributed Derivation Trees}, url = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3003&spage=208}, volume = 3003, year = 2004 }