A self-adaptive mate selection model for genetic programming

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper documents new extensions to the selection model in genetic programming, designed to be analogous to the more complex behaviour of selection in natural evolution. Specifically, a negative assortative mating scheme is presented in conjunction with a model of psychological evolution, allowing the mating strategy to change throughout the evolutionary process. Results show that self-adaptive mate selection accelerates evolution for several well known test problems.

Original languageEnglish
Title of host publication2005 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-3, PROCEEDINGS
Place of PublicationNEW YORK
PublisherIEEE
Pages2707-2714
Number of pages8
ISBN (Print)0-7803-9363-5
Publication statusPublished - 2005
EventIEEE Congress on Evolutionary Computation - Edinburgh
Duration: 2 Sept 20055 Sept 2005

Conference

ConferenceIEEE Congress on Evolutionary Computation
CityEdinburgh
Period2/09/055/09/05

Cite this