Selection Based on the Pareto Nondomination Criterion for Controlling Code Growth in Genetic Programming

  • Authors:
  • Anikó Ekárt;S. Z. Németh

  • Affiliations:
  • Computer and Automation Research Institute, Hungarian Academy of Sciences, 1518 Budapest, P.O.B. 63, Hungary ekart@sztaki.hu;Computer and Automation Research Institute, Hungarian Academy of Sciences, 1518 Budapest, P.O.B. 63, Hungary snemeth@sztaki.hu

  • Venue:
  • Genetic Programming and Evolvable Machines
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The rapid growth of program code is an important problem in genetic programming systems. In the present paper we investigate a selection scheme based on multiobjective optimization. Since we want to obtain accurate and small solutions, we reformulate this problem as multiobjective optimization. We show that selection based on the Pareto nondomination criterion reduces code growth and processing time without significant loss of solution accuracy.