School of Computing

Semantic analysis of program initialisation in genetic programming

Lawrence Beadle and Colin G Johnson

Genetic Programming and Evolvable Machines, 10(3):182-196, September 2009 [doi].




Population initialisation in genetic programming is both easy, because random combinations of syntax can be generated straightforwardly, and hard, because these random combinations of syntax do not always produce random and diverse program behaviours. In this paper we perform analyses of behavioural diversity, the size and shape of starting populations, the effects of purely semantic program initialisation and the importance of tree shape in the context of program initialisation. To achieve this, we create four different algorithms, in addition to using the traditional ramped half and half technique, applied to seven genetic programming problems. We present results to show that varying the choice and design of program initialisation can dramatically influence the performance of genetic programming. In particular, program behaviour and evolvable tree shape can have dramatic effects on the performance of genetic programming. The four algorithms we present have different rates of success on different problems.

Bibtex Record

author = {Lawrence Beadle and Colin G Johnson},
title = {Semantic analysis of program initialisation in genetic programming},
month = {September},
year = {2009},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {10.1007/s10710-009-9082-5},
url = {},
    publication_type = {article},
    submission_id = {18405_1248687084},
    ISSN = {1389-2576},
    journal = {Genetic Programming and Evolvable Machines},
    volume = {10},
    number = {3},
    publisher = {Springer},

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014