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

Created by W.Langdon from gp-bibliography.bib Revision:1.7630

@Article{ekart:2001:genp,

• author = "Aniko Ekart and S. Z. Nemeth",
• title = "Selection Based on the Pareto Nondomination Criterion for Controlling Code Growth in Genetic Programming",
• journal = "Genetic Programming and Evolvable Machines",
• year = "2001",
• volume = "2",
• number = "1",
• pages = "61--73",
• month = mar,
• keywords = "genetic algorithms, genetic programming, code growth, selection scheme, multiobjective optimization",
• ISSN = "1389-2576",
• DOI = "doi:10.1023/A:1010070616149",
• 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.",
• notes = "Article ID: 319813",

}

Genetic Programming entries for Aniko Ekart Sandor Zoltan Nemeth

Citations