Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/3617

Title

Breeding subroutines for evolutionary programs

Author(s)

Deller, Adam;  Hendtlass, Tim

Abstract

This paper describes the development and testing of a genetic programming architecture that includes subroutine functionality, implemented as separate island populations. Within the subroutine population, individuals are divided into “castes” based on utilisation. Fitness values for the subroutines are estimated using a function of calling program fitness. This approach differs markedly to previous attempts at enabling subroutine usage by genetic programs, where subroutines (known as Automatically Defined Functions or ADFs) are intrinsic to a program and can only be used by that program. Results obtained using a common genetic programming problem known as WallSearch are presented. The use of subroutines results in a saving in computational effort of up to 50%, compared to a single program population.

Publication type

Conference paper

Research centre

Swinburne University of Technology. Faculty of Information and Communication Technologies

Source

Paper presented to the 7th Asia-Pacific Complex Systems Conference (Complex 2004), Cairns, Queensland, Australia, 06-10 December 2004

Publication year

2004

Publisher

Central Queensland University Press

Publisher URL

http://complex2004.cqu.edu.au/index.html

Peer reviewed