Evolving While-Loop Structures in Genetic Programming for Factorial and Ant Problems

Loop is an important structure in human written programs. However, it is seldom used in the evolved programs in genetic programming (GP). This paper describes an approach to the use of while-loop structure in GP for the factorial and the artificial ant problems. Two different forms of the while-loop structure, count-controlled loop and event-controlled loop, are investigated. The results suggest that both forms of the while-loop structure can be successfully evolved in GP, the system with the while-loop structure is more effective and more efficient than the standard GP system for the two problems, and the evolved genetic programs with the loop-structure are much easier to interpret.

[1]  Mengjie Zhang,et al.  Multiclass Object Classification Using Genetic Programming , 2004, EvoWorkshops.

[2]  Kenneth E. Kinnear,et al.  Generality and Difficulty in Genetic Programming: Evolving a Sort , 1993, ICGA.

[3]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[4]  Xiang Li,et al.  Experiments with explicit for-loops in genetic programming , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[5]  K. E. Kinnear,et al.  Evolving a sort: lessons in genetic programming , 1993, IEEE International Conference on Neural Networks.

[6]  David J. Montana,et al.  Strongly Typed Genetic Programming , 1995, Evolutionary Computation.

[7]  Victor Ciesielski,et al.  Genetic Programming for Multiple Class Object Detection , 1999, Australian Joint Conference on Artificial Intelligence.