Abstract
Using Genetic Programming difficult optimization 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.
In this paper an already 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 parameterize, moreover the algorithm is better guided, thus it can converge faster.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Ványi, R., Zvada, S.: Avoiding syntactically incorrect individuals via parameterized operators applied on derivation trees. In: Proceedings of the 2003 Congress on Evolutionary Computation CEC 2003, Canberra, pp. 2791–2798. IEEE Press, Los Alamitos (2003)
Moll, R.N., Arbib, M.A., Kfoury, A.J.: An Introduction to Formal Language Theory. Springer, New York (1988)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading (1979)
Chomsky, N.: On certain formal properties of grammars. Information and Control 2, 137–167 (1959)
Ryan, C., Collins, J., O’Neill, M.: Grammatical evolution: Evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83–95. Springer, Heidelberg (1998)
O’Neill, M., Ryan, C.: Grammatical Evolution - Evolving programs in an arbitrary language. Genetic Programming, vol. 4. Kluwer Academic Publishers, Dordrecht (2003)
Whigham, P.A.: Grammatically-based genetic programming. In: Rosca, J.P. (ed.) Proceedings of the Workshop on Genetic Programming: From Theory to Real- World Applications, Tahoe City, California, USA, pp. 33–41 (1995)
Montana, D.J.: Strongly typed genetic programming. Evolutionary Computation 3, 199–230 (1995)
Alblas, H., Melichar, B. (eds.) In: SAGA School 1991. LNCS, vol. 545, Springer, Heidelberg (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zvada, S., Ványi, R. (2004). Improving Grammar-Based Evolutionary Algorithms via Attributed Derivation Trees. In: Keijzer, M., O’Reilly, UM., Lucas, S., Costa, E., Soule, T. (eds) Genetic Programming. EuroGP 2004. Lecture Notes in Computer Science, vol 3003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24650-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-24650-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21346-8
Online ISBN: 978-3-540-24650-3
eBook Packages: Springer Book Archive