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

作者: Anikó Ekárt , S. Z. Németh

DOI: 10.1023/A:1010070616149

关键词:

摘要: 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 want to obtain accurate and small solutions, reformulate this as We show that Pareto nondomination criterion reduces processing time without significant loss solution accuracy.

参考文章(16)
Nicholas S. Flann, Dale C. Hooper, Improving the accuracy and robustness of genetic programming through expression simplification Proceedings of the 1st annual conference on genetic programming. pp. 428- 428 ,(1996)
Peter J. Angeline, Genetic programming and emergent intelligence Advances in genetic programming. pp. 75- 97 ,(1994)
Wolfgang Banzhaf, Peter Nordin, Frank Francone, Explicitly defined introns and destructive crossover in genetic programming Advances in genetic programming. pp. 111- 134 ,(1996)
Hitoshi Iba, Hugo de Garis, Taisuke Sato, Genetic programming using a minimum description length principle Advances in genetic programming. pp. 265- 284 ,(1994)
W. B. Langdon, R. Poli, Fitness Causes Bloat Soft Computing in Engineering Design and Manufacturing. pp. 13- 22 ,(1998) , 10.1007/978-1-4471-0427-8_2
J. Horn, N. Nafpliotis, D.E. Goldberg, A niched Pareto genetic algorithm for multiobjective optimization world congress on computational intelligence. pp. 82- 87 ,(1994) , 10.1109/ICEC.1994.350037
William B. Langdon, Scaling of program fitness spaces Evolutionary Computation. ,vol. 7, pp. 399- 428 ,(1999) , 10.1162/EVCO.1999.7.4.399
W. B. Langdon, Size Fair and Homologous Tree Crossovers for Tree Genetic Programming Genetic Programming and Evolvable Machines. ,vol. 1, pp. 95- 119 ,(2000) , 10.1023/A:1010024515191