A Comparison of three evolutionary strategies for multiobjective genetic programming

Authors:
Yang Zhang;Peter Rockett
Affiliations:
Vision and Information Engineering Group, Department of Electronic and Electrical Engineering, The University of Sheffield, Sheffield, UK S1 3JD;Vision and Information Engineering Group, Department of Electronic and Electrical Engineering, The University of Sheffield, Sheffield, UK S1 3JD
Venue:
Artificial Intelligence Review
Year:
2007

Citing 17
Cited 3

Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
The nature of statistical learning theory

The nature of statistical learning theory
Approximate statistical tests for comparing supervised classification learning algorithms

Neural Computation
Combined 5 × 2 cv F test for comparing supervised classification learning algorithms

Neural Computation
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms

Machine Learning
Evolutionary Algorithms for Solving Multi-Objective Problems

Evolutionary Algorithms for Solving Multi-Objective Problems
Selection Based on the Pareto Nondomination Criterion for Controlling Code Growth in Genetic Programming

Genetic Programming and Evolvable Machines
Improved sampling of the Pareto-front in multiobjective genetic optimizations by steady-state evolution: a Pareto converging genetic algorithm

Evolutionary Computation
Non-destructive Depth-Dependent Crossover for Genetic Programming

EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Evolving optimal feature extraction using multi-objective genetic programming: a methodology and preliminary study on edge detection

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

Evolutionary Computation
What makes a problem GP-hard? validating a hypothesis of structural causes

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Evolving computer programs without subtree crossover

IEEE Transactions on Evolutionary Computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach

IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation
'Identifying the structure of nonlinear dynamic systems using multiobjective genetic programming

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

A generic optimising feature extraction method using multiobjective genetic programming

Applied Soft Computing
Evolutionary multi objective optimization for rule mining: a review

Artificial Intelligence Review
Two layered Genetic Programming for mixed-attribute data classification

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report what we believe to be the first comparative study of multi-objective genetic programming (GP) algorithms on benchmark symbolic regression and machine learning problems. We compare the Strength Pareto Evolutionary Algorithm (SPEA2), the Non-dominated Sorting Genetic Algorithm (NSGA-II) and the Pareto Converging Genetic Algorithm (PCGA) evolutionary paradigms. As well as comparing the quality of the final solutions, we also examine the speed of convergence of the three evolutionary algorithms. Based on our observations, the SPEA2-based algorithm appears to have problems controlling tree bloat--that is, the uncontrolled growth in the size of the chromosomal tree structures. The NSGA-II-based algorithm on the other hand seems to experience difficulties in locating low error solutions. Overall, the PCGA-based algorithm gives solutions with the lowest errors and the lowest mean complexity.