Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at https://www.ucl.ac.uk/finance/research/rs-contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
Backward-chaining Genetic Programming
  • Publication Type:
  • Authors:
    Poli R, Langdon WB
  • Publisher:
    Department of Computing and Electronic Systems, University of Essex
  • publication date:
  • Place of publication:
    Colchester, UK
  • Report number:
    CSM 425
  • Status:
  • Series name:
    Technical Reports
  • Print ISSN:
  • Keywords:
    genetic algorithms, genetic programming notes
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. As noted in [7], even if this process is repeated many times in each generation, there is always a nonzero probability that some of the individuals in the population will not be involved in any tournament. In certain conditions, typical in GP, the number of individuals in this category can be large. Because these individuals have no influence on future generations, it is possible to avoid creating and evaluating them without altering in any significant way the course of a run. [7] proposed an algorithm, the backward chaining EA (BC-EA), to realised this, but provided limited empirical evidence of the actual savings and the experiments were restricted to fixed-length genetic algorithms. In contrast we provide a generational genetic programming implementation of BC-EA and empirically investigate the efficiency in terms of fitness evaluations and memory use and effectiveness in terms of ability to solve problems of BC-GP. Results indicate that large savings can be obtained with this approach.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Dept of Computer Science
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by