Characterizing diversity in genetic programming

Authors:
Bart Wyns;Peter De Bruyne;Luc Boullart
Affiliations:
Department of Electrical Energy, System and Automation Ghent University, Zwijnaarde, Belgium;Department of Electrical Energy, System and Automation Ghent University, Zwijnaarde, Belgium;Department of Electrical Energy, System and Automation Ghent University, Zwijnaarde, Belgium
Venue:
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Year:
2006

Citing 7
Cited 4

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Selection Based on the Pareto Nondomination Criterion for Controlling Code Growth in Genetic Programming

Genetic Programming and Evolvable Machines
A Survey And Analysis Of Diversity Measures In Genetic Programming

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Multi-Objective Methods for Tree Size Control

Genetic Programming and Evolvable Machines
Problem Difficulty and Code Growth in Genetic Programming

Genetic Programming and Evolvable Machines
Effects of code growth and parsimony pressure on populations in genetic programming

Evolutionary Computation
Diversity in genetic programming: an analysis of measures and correlation with fitness

IEEE Transactions on Evolutionary Computation

Behavioural Diversity and Filtering in GP Navigation Problems

EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Viewing the problem from different angles: a new diversity measure based on angular distances

Journal of Artificial Evolution and Applications
Promoting phenotypic diversity in genetic programming

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Phenotypic diversity in initial genetic programming populations

EuroGP'10 Proceedings of the 13th European conference on Genetic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many evolutionary algorithms candidate solutions run the risk of getting stuck in local optima after a few generations of optimization. In this paper two improved approaches to measure population diversity are proposed and validated using two traditional test problems in genetic programming literature. Code growth gave rise to improve pseudo-isomorph measures by eliminating non-functional code using an expression simplifier. Also, Rosca's entropy to measure behavioral diversity is updated to cope with problems producing a more continuous fitness value. Results show a relevant improvement with regard to the original diversity measures.