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.
Similar content being viewed by others
References
Peter J. Angeline, "Genetic programming and emergent intelligence," in Advances in Genetic Programming, Kenneth E. Kinnear (ed.), MIT Press: Cambridge, MA, 1994, pp. 75–97.
Carlos A. Coello Coello, “An updated survey of evolutionary multiobjective optimization techniques: state of the art and future trends,” in Proc. Congress on Evolutionary Computation, 1999, pp. 3–13.
Dale C. Hooper and Nicholas S. Flann, “Improving the accuracy and robustness of genetic programming through expression simplication,” in Genetic Programming 1996: Proc. First Annu. Conf., John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo (eds.), 1996, p. 428.
Jeffrey Horn, Nicholas Nafpliotis, and David E. Goldberg, “A niched Pareto genetic algorithm for multi objective optimization,” in Proc. First IEEE Conf. Evolutionary Computation, 1994, pp. 82–87.
Hitoshi Iba, Hugo de Garis, and Taisuke Sato, “Genetic programming using a minimum description length principle,” in Advances in Genetic Programming, Kenneth E. Kinnear (ed.), MIT Press: Cambridge, MA 1994, pp. 265–284.
John R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press: Cambridge, MA, 1992.
John R. Koza, Genetic Programming: Automatic Discovery of Reusable Programs, MIT Press: Cambridge, MA, 1994.
William B. Langdon, “Scaling of program tree fitness spaces,” Evolutionary Computation vol. 7, no. 4, pp. 399–428, 1999.
William B. Langdon, “Size fair and homologous tree crossovers for tree genetic programming,” Genet. Programming Evol. Mach., vol. 1, 95–119, 2000.
William B. Langdon and Riccardo Poli, “Fitness causes bloat,” in Soft Computing in Engineering Design and Manufacturing, P. K. Chawdhry, R. Roy, and R. K. Pant (eds.), 1997, pp. 13–22.
Peter Nordin, Frank D. Francone, and Wolfgang Banzhaf, “Explicitly defined introns and destructive crossover in genetic programming,” in Proc. Workshop on Genetic Programming: From Theory to Real-World Applications, Justinian P. Rosca, (ed.), 1995, pp. 6–22.
J. David Schaffer, “Multiple objective optimization with vector evaluated genetic algorithm,” in Genetic Algorithms and their Applications: Proc. First Int. Conf. Genetic Algorithms, 1985, pp. 93–100.
Terence Soule, James A. Foster, and John Dickinson, “Code growth in genetic programming,” in Genetic Programming 1996: Proc. First Annu. Conf., John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo (eds.), 1996, pp. 215–223.
David A. Van Veldhuizen and Gary B. Lamont, “Multiobjective evolutionary algorithms: analyzing the state of the art,” Evol. Comput. vol. 8, no. 2, pp. 125–147, 2000.
Byoung-Tak Zhang and Heinz Mühlenbein, “Balancing accuracy and parsimony in genetic programming,”. Evol. Comput. vol. 3, no. 1, pp. 17–38, 1995.
Eckart Zitzler, Kalyanmoy Deb, and Lothar Thiele, “Comparison of multiobjective evolutionary algorithms: empirical results,” Evol. Comput. vol. 8, no. 2, pp. 173–195, 2000.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ekárt, A., Németh, S.Z. Selection Based on the Pareto Nondomination Criterion for Controlling Code Growth in Genetic Programming. Genetic Programming and Evolvable Machines 2, 61–73 (2001). https://doi.org/10.1023/A:1010070616149
Issue Date:
DOI: https://doi.org/10.1023/A:1010070616149