Abstract
In this article a set of guidelines for the design of genetic operators and the representation of the phenotype space is proposed. These guidelines should help to systematize the design of problem-specific evolutionary algorithms. Hence, they should be particularly beneficial for the design of genetic programming systems.
The applicability of this concept is shown by the systematic design of a genetic programming system for finding Boolean functions. This system is the first GP-system, that reportedly found the 12 parity function.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 35, 677–691 (1986)
Chellapilla, K.: Evolving computer programs without subtree crossover. IEEE Transactions on Evolutionary Computation 1(3), 209–216 (1997)
Chellapilla, K.: A preliminary investigation into evolving modular programs without subtree crossover. In: Koza, J.R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M.H., Goldberg, D.E., Iba, H., Riolo, R.L. (eds.) Proc. Third Annual Genetic Programming Conference, Madison WS, July 22-25, pp. 23–31. Morgan Kaufmann, San Francisco (1998)
Droste, S.: Efficient genetic programming for finding good generalizing Boolean functions. In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M.H., Iba, H., Riolo, R.L. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, Stanford University, July 13-16, pp. 82–87. Morgan Kaufmann, San Francisco (1997)
Gathercole, C., Ross, P.: Tackling the Boolean even n parity problem with genetic programming and limited-error fitness. In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M.H., Iba, H., Riolo, R.L. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, Stanford University, July 13-16, pp. 119–127. Morgan Kaufmann, San Francisco (1997)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Koza, J.R.: Genetic Programming II. MIT Press, Cambridge (1994)
Rechenberg, I.: Evolutionsstrategie 1994. Frommann-Holzboog, Stuttgart (1994)
Rudolph, G.: Finite Markov chain results in evolutionary computation: A tour d’horizon. Fundamenta Informaticae 35(1-4), 67–89 (1998)
Schwefel, H.-P.: Evolution and Optimum Seeking. Sixth-Generation Computer Technology Series. Wiley, New York (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Droste, S., Wiesmann, D. (2000). Metric Based Evolutionary Algorithms. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds) Genetic Programming. EuroGP 2000. Lecture Notes in Computer Science, vol 1802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46239-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-46239-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67339-2
Online ISBN: 978-3-540-46239-2
eBook Packages: Springer Book Archive