RLGP: An efficient method to avoid code bloating on genetic programming

Proceedings of the 2007 IEEE International Conference on Mechatronics and Automation, ICMA 2007

Volumn , Issue , 2007, Pages 2945-2950

  Liangxu, Liu ^a,b   Haibin, Cai ^a   Mingyou, Ying ^a   Jiajin, Le ^a  

^a DONGHUA UNIVERSITY   (China)

^b NINGBO UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Code bloat; Diversity; Evolutionary computation; Genetic programming

Indexed keywords

EVOLUTIONARY ALGORITHMS; PROBLEM SOLVING;

BLOATING; CODE BLOAT; DEPTH LIMIT; SIZE CONTROL;

GENETIC PROGRAMMING;

EID: 37049036131     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMA.2007.4304028     Document Type: Conference Paper

References (24)

1. Sean Luke, "Genetic Programming Produced Competitive Soccer Softbot Teams for RoboCup97," Genetic Programming 1998: Proceedings of the Third Annual Conference, San Francisco, pp: 204-222, 1998.
2. Mohammed Muharram, George D. Smith, "Evolutionary constructive induction," IEEE transactions on knowledge and data engineering, vol. 1.7, no. (11), pp. 1518-1528, 2005.
3. Dong Song, Malcolm I. Heywood, "Training genetic programming on half a million patterns: an example from anomaly detection," IEEE transactions on evolutionary computation, vol. 9, no. 3, pp. 225-238. 2005.
4. Justinian P. Rosca, "Generality versus size in genetic programming," Genetic programming 1996: Proceedings of the first annual conference, pp. 381-387, Stanford University, 1996.
5. Sean Luke, "Evolutionary computation and the C-value paradox," Proceedings of the 2005 conference on Genetic and evolutionary computation, Washington DC, USA, pp. 91-97, 2005.
6. Sean Luke, "Issues in Scaling Genetic Programming: Breeding Strategies, Tree Generation, and Code Bloat," doctoral dissertation, University of Maryland, 2000.
7. Sean Luke, "Modification point depth and genome growth in genetic programming," Evolutionary Computation, vol. 11, no. 1, pp. 67-106, 2003.
8. Langdon W. B., & Poli. R, "Fitness causes bloat: Mutation," Proceedings of the first European workshop on genetic programming, Springer-Verlag, Paris, vol. 1391, pp. 37-48, 1998.
9. Koza, J. R., "Genetic programming: On the programming of computers by means of natural selection," Cambridge, MA: MIT Press, 1992.
10. Chris Gathercole, Peter Ross, "An Adverse Interaction between the Crossover Operator and a Restriction on Tree Depth," Genetic Programming 1996: Proceedings of the First Annual Conference. Stanford. University, pp. 291-296, 1996.
11. Burke D. S., De Jong, K. A. Grefenstette, J. J., Ramsey, C. L., and Wu, A. S., "Putting more genetics into genetic algorithms," Evolutionary Computation, vol. 6, no. 4, pp. 387-410, 1998.
12. Cavaretta M. J., Chellapilla K., "Data mining using genetic programming: The implications of parsimony on generalization error," Proceedings of the Congress on Evolutionary Computation, Washington D.C., USA, IEEE Press, vol. 2, pp. 1330-1337, 1999.
13. Nordin P., & Banzhaf W., "Complexity Compression and Evolution," Genetic Algorithms: Proceedings of Sixth International Conference (ICGA95), Morgan Kaufmann, pp. 310-317, 1995.
14. Zhang B.-T., and M'uhlenbein H., "Balancing accuracy and parsimony in genetic programming," Evolutionary Computation, vol. 3, no. 1, pp. 17-38, 1995.
15. Iba H., de Garis H., and Sato T., "Genetic programming using a minimum description length principle," Advances in Genetic programming, MIT Press, chapter 12, pp. 265-284, 1994.
16. Wu A., Schultz A., and Agah A., "Evolving control for distributed micro air vehicles," IEEE Computational Intelligence in Robotics and Automation Engineers Conference, Monterey, pp. 174-179, 1999.
17. Bassett, J. K. and De Jong, K. A., "Evolving behaviors for cooperating agents," International Syposium on Methodologies for Intelligent Systems, pp. 157-165, 2000.
18. Soule T., "Code growth in genetic Programming," Doctoral Dissertation, University of Idaho, 1998.
19. Bleuler S., Brack M., Thiele L., and Zitzler, E., "Multiobjective genetic programming: Reducing bloat using spea2," Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, IEEE Press, pp. 536-543, 2001.
20. DeJong E. D., Watson R. A., and Pollack J. B., "Reducing bloat and promoting diversity using multiobjective methods," Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco, California, USA, Morgan Kaufmann, pp. 11-18, 2001.
21. Ekart A. and Nemeth S. Z., "Selection based on the pareto nondomination criterion for controlling code growth in genetic programming," Genetic Programming and Evolvable Machines. Vol. 2, no. 1, pp. 61-73, 2001
22. S. Luke and L. Panait, "Fighting Bloat with Nonparametric Parsimony Pressure," Proceedings of the Seventh International Conference on Parallel Problem Solving from Nature, Springer-Verlag, Berlin, pp. 411-421, 2002.
23. Nordin P., Francone F., and Banzhaf W., "Explicitly defined introns and destructive crossover in genetic programming," Advances in Genetic Programming 2, Cambridge, MA, USA, MIT Press, pp. 111-134, 1996.
24. Soule T., Foster J. A., and Dickinson J., "Code growth in genetic programming," Genetic Programming 1996: Proceedings of the First Annual Conference, Stanford University, CA, USA, MIT Press, pp. 215-223, 1996.