UCL  IRIS
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 http://www.ucl.ac.uk/finance/research/post_award/post_award_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
Pareto, Population Partitioning, Price and Genetic Programming
  • Publication Type:
    Report
  • Authors:
    Langdon WB
  • publication date:
    04/1995
  • Place of publication:
    Gower Street, London WC1E 6BT, UK
  • Report number:
    RN/95/29
  • Notes:
    keywords: genetic algorithms, genetic programming, Automatic Programming, Machine Learning, Artificial Evolution, Pareto fitness, Demes notes: Accepted by AAAI Fall 1995 Genetic Programming Symposium but withdrawn due to time pressures multiobjective Pareto front size: 11 pages
Abstract
A description of a use of Pareto optimality in genetic programming is given and an analogy with Genetic Algorithm fitness niches is drawn. Techniques to either spread the population across many pareto optimal fitness values or to reduce the spread are described. It is speculated that a wide spread may not aid Genetic Programming. It is suggested that this might give useful insight into many GPs whose fitness is composed of several sub-objectives. The successful use of demic populations in GP leads to speculation that smaller evolutionary steps might aid GP in the long run. An example is given where Price’s covariance theorem helped when designing a GP fitness function.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Author
Dept of Computer Science
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by