Abstract
One of the key characteristics of EvolutionaryAlgorithms is the manner in which solutions are evolved from a primordial soup. Theway this soup, or initial generation, is created can have major implications for the eventual quality of the search, as, if there is not enough diversity, the population may become stuck on a local optimum.
This paper reports an initial investigation using a position independent evolutionary algorithm, Chorus, where the usual random initialisation has been compared to an approach modelled on the GP ramped half and half method. Three standard benchmark problems have been chosen from the GP literature for this study. It is shown that the new initialisation method, termed sensible initialisation maintains populations with higher average fitness especially earlier on in evolution than with random initialisation. Only one of the benchmarks fails to show an improvement in a probability of success measure, and we demonstrate that this is more likely a symptom of issues with that benchmark than with the idea of sensible initialisation.
Performance seems to be unaffected by the different derivation tree depths used, and having a wider pool of individuals, regardless of their average size, seems enough to improve the performance of the system.
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
R. M. A. Azad, C. Ryan, M. E. Burke and A. R. Ansari, A Re-examination Of The Cart Centering Problem Using The Chorus System. In the proceedings of Genetic and Evolutionary Computation Conference (GECCO), 2002 (pp 707–715), Morgan Koffman, NYC, NY, 2002.
J. J. Grefenstette, Incorporating Problem Specific Knowledge into Genetic Algorithms. Genetic Algorithms and Simulated Annealing (pp 42–60), L. Davis(ed.), Morgan Koffman, Los Altos, CA, 1987.
J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Evolution, MIT Press, Cambridge, MA, 1992.
W. B. Langdon and R. Poli, Why Ants are Hard. In the proceedings of Genetic Programming 1998: The Third Annual Conference, 1998.
S. Luke and L. Paniat, Is Perfect the enemy of the Good? In the proceedings of Genetic and Evolutionary Computation Conference(GECCO) 2002 (pp 820–828), Morgan Koffman, NYC, NY, 2002.
J. O’Sullivan and C. Ryan, An Investigation into the Use of Different Search Strategies with Grammatical Evolution. In the proceedings of European Conference on Genetic Programming (EuroGP2002) (pp268–277), Springer, 2002.
A. Ratle and M. Sebag, Genetic Programming and Domain Knowledge: Beyond the Limitations of Grammar-Guided Machine Discovery. In the proceedings of Parallel Problem Solving from Nature(PPSN VI)(pp 211–220), Springer, 2000.
C. Ryan, A. Azad, A. Sheahan and M. O’Neill, No Coercion and No Prohibition, A Position Independent Encoding Scheme for Evolutionary Algorithms-The Chorus System. In the Proceedings of European Conference on Genetic Programming (EuroGP 2002) (pp131–141), Springer, 2002.
C. Ryan, J. J. Collins and M. O’Neill, Grammatical Evolution: Evolving Programs for an Arbitrary Language, in EuroGP’98: Proc. of the First European Workshop on Genetic Programming (Lecture Notes in Computer Science 1391, pp 83–95), Springer, Paris, France, 1998.
D. Whitley, K. Mathias and P. Fotzhorn, Delta Coding: An Iterative Search Strategy for Genetic Algorithms. Proceedings of Fourth International Conference on Genetic Algorithms (pp 77–84), Morgan Koffman, San Diego, CA, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ryan, C., Azad, R.M.A. (2003). Sensible Initialisation in Chorus. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds) Genetic Programming. EuroGP 2003. Lecture Notes in Computer Science, vol 2610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36599-0_37
Download citation
DOI: https://doi.org/10.1007/3-540-36599-0_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00971-9
Online ISBN: 978-3-540-36599-0
eBook Packages: Springer Book Archive