Shinichi Shirakawa
ABSTRACT
In recent years a lot of Automatic Programming techniques have developed. A typical example of Automatic Programming is Genetic Programming (GP), and various extensions and representations for GP have been proposed so far. However, it seems that more improvements are necessary to obtain complex programs automatically. In this paper we proposed a new method called Graph Structured Program Evolution (GRAPE). The representation of GRAPE is graph structure, therefore it can represent complex programs (e.g. branches and loops) using its graph structure. Each program is constructed as an arbitrary directed graph of nodes and data set. The GRAPE program handles multiple data types using the data set for each type, and the genotype of GRAPE is the form of a linear string of integers. We apply GRAPE to four test problems, factorial, Fibonacci sequence, exponentiation and reversing a list, and demonstrate that the optimum solution in each problem is obtained by the GRAPE system.
- A. Agapitos and S. M. Lucas. Learning recursive functions with object oriented genetic programming. In P. Collet, M. Tomassini, M. Ebner, S. Gustafson, and A. Ekárt, editors, Proceedings of the 9th European Conference on Genetic Programming, volume 3905 of Lecture Notes in Computer Science, pages 166--177, Budapest, Hungary, 10 -- 12 Apr. 2006. Springer. Google Scholar
Digital Library
- P. J. Angeline and J. B. Pollack. Evolutionary module acquisition. In D. Fogel and W. Atmar, editors, Proceedings of the Second Annual Conference on Evolutionary Programming, pages 154--163, La Jolla, CA, USA, 25--26 1993.Google Scholar
- M. Brameier and W. Banzhaf. A comparison of linear genetic programming and neural networks in medical data mining. IEEE Transactions on Evolutionary Computation, 5(1):17--26, Feb. 2001. Google ScholarDigital Library
- T. Eguchi, K. Hirasawa, J. Hu, and N. Ota. A study of evolutionary multiagent models based on symbiosis. IEEE Transactions on Systems, Man and Cybernetics Part B, 36(1):179--193, 2006. Google ScholarDigital Library
- W. Kantschik and W. Banzhaf. Linear-tree GP and its comparison with other GP structures. In J. F. Miller, M. Tomassini, P. L. Lanzi, C. Ryan, A. G. B. Tettamanzi, and W. B. Langdon, editors, Genetic Programming, Proceedings of EuroGP'2001, volume 2038 of LNCS, pages 302--312, Lake Como, Italy, 18--20 Apr. 2001. Springer-Verlag. Google ScholarDigital Library
- W. Kantschik and W. Banzhaf. Linear-graph GP-A new GP structure. In J. A. Foster, E. Lutton, J. Miller, C. Ryan, and A. G. B. Tettamanzi, editors, Genetic Programming, Proceedings of the 5th European Conference, EuroGP 2002, volume 2278 of LNCS, pages 83--92, Kinsale, Ireland, 3--5 Apr. 2002. Springer-Verlag. Google ScholarDigital Library
- H. Katagiri, K. Hirasawa, J. Hu, and J. Murata. Network structure oriented evolutionary model-genetic network programming-and its comparison with genetic programming. In E. D. Goodman, editor, 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers, pages 219--226, San Francisco, California, USA, 9--11 July 2001.Google Scholar
- H. Kita, I. Ono, and S. Kobayashi. Multi-parental extension of the unimodal normal distribution crossover for real-coded genetic algorithms. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC99), volume 2, pages 1581--1587, 1999.Google ScholarCross Ref
- J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992. Google ScholarDigital Library
- J. R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge, MA, USA, 1994. Google ScholarDigital Library
- S. Lucas. Exploiting reflection in object oriented genetic programming. In M. Keijzer, U.-M. O'Reilly, S. M. Lucas, E. Costa, and T. Soule, editors, Genetic Programming 7th European Conference, EuroGP 2004, Proceedings, volume 3003 of LNCS, pages 369--378, Coimbra, Portugal, 5--7 Apr. 2004. Springer-Verlag.Google Scholar
- J. F. Miller and S. L. Smith. Redundancy and computational efficiency in cartesian genetic programming. IEEE Transactions on Evolutionary Computation, 10(2):167--174, Apr. 2006. Google ScholarDigital Library
- J. F. Miller and P. Thomson. Cartesian genetic programming. In R. Poli, W. Banzhaf, W. B. Langdon, J. F. Miller, P. Nordin, and T. C. Fogarty, editors, Genetic Programming, Proceedings of EuroGP'2000, volume 1802 of LNCS, pages 121--132, Edinburgh, 15--16 Apr. 2000. Springer-Verlag. Google ScholarDigital Library
- D. J. Montana. Strongly typed genetic programming. Evolutionary Computation, 3(2):199--230, 1995. Google ScholarDigital Library
- M. O'Neill and C. Ryan. Grammatical evolution. IEEE Transactions on Evolutionary Computation, 5(4):349--358, Aug. 2001. Google ScholarDigital Library
- M. O'Neill and C. Ryan. Grammatical Evolution: Evolutionary Automatic Programming in a Arbitrary Language, volume 4 of Genetic programming. Kluwer Academic Publishers, 2003. Google ScholarDigital Library
- R. Poli. Evolution of graph-like programs with parallel distributed genetic programming. In T. Back, editor, Genetic Algorithms: Proceedings of the Seventh International Conference, pages 346--353, Michigan State University, East Lansing, MI, USA, 19--23 July 1997. Morgan Kaufmann.Google Scholar
- H. Satoh, M. Yamamura, and S. Kobayashi. Minimal generation gap model for considering both exploration and exploitations. In Proceedings of the IIZUKA'96, pages 494--497, 1996.Google Scholar
- L. Spector. Simultaneous evolution of programs and their control structures. In P. J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, pages 137--154. MIT Press, Cambridge, MA, USA, 1996. Google ScholarDigital Library
- L. Spector. Autoconstructive evolution: Push, pushGP, and pushpop. In L. Spector, E. D. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, and E. Burke, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 137--146, San Francisco, California, USA, 7--11 July 2001. Morgan Kaufmann.Google Scholar
- L. Spector, J. Klein, and M. Keijzer. The push3 execution stack and the evolution of control. In H.-G. Beyer, U.-M. O'Reilly, D. V. Arnold, W. Banzhaf, C. Blum, E. W. Bonabeau, E. Cantu-Paz, D. Dasgupta, K. Deb, J. A. Foster, E. D. de Jong, H. Lipson, X. Llora, S. Mancoridis, M. Pelikan, G. R. Raidl, T. Soule, A. M. Tyrrell, J.-P. Watson, and E. Zitzler, editors, GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, volume 2, pages 1689--1696, Washington DC, USA, 25--29 June 2005. ACM Press Google ScholarDigital Library
- L. Spector and A. Robinson. Genetic programming and autoconstructive evolution with the push programming language. Genetic Programming and Evolvable Machines, 3(1):7--40, Mar. 2002. Google ScholarDigital Library
- A. Teller. Learning mental models. In Proceedings of the Fifth Workshop on Neural Networks: An International Conference on Computational Intelligence: Neural Networks, Fuzzy Systems, Evolutionary Programming, and Virtual Reality, 1993.Google Scholar
- A. Teller. Turing completeness in the language of genetic programming with indexed memory. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, volume 1, pages 136--141, Orlando, Florida, USA, 27--29 June 1994. IEEE Press.Google ScholarCross Ref
- A. Teller and M. Veloso. Program evolution for data mining. The International Journal of Expert Systems, 8(3):216--236, 1995.Google Scholar
- A. Teller and M. Veloso. PADO: A new learning architecture for object recognition. In K. Ikeuchi and M. Veloso, editors, Symbolic Visual Learning, pages 81--116. Oxford University Press, 1996. Google ScholarDigital Library
- S. Tsutsui, M. Yamamura, and T. Higuchi. Multi-parent re-combination with simplex crossover in real coded genetic algorithms. In In Proceedings of Genetic and Evolutionary Computation Conference (GECCO'99), pages 657--664, 1999.Google Scholar
Index Terms
- Graph structured program evolution
Recommendations
Graph structured program evolution with automatically defined nodes
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computationCurrently, various automatic programming techniques have been proposed and applied in various fields. Graph Structured Program Evolution (GRAPE) is a recent automatic programming technique with graph structure. This technique can generate complex ...
Evolutionary algorithm considering program size: efficient program evolution using grape
GECCO '08: Proceedings of the 10th annual conference companion on Genetic and evolutionary computationToday, a lot of Automatic Programming techniques have been proposed and applied various fields. Graph Structured Program Evolution (GRAPE) is one of the recent Automatic Programming techniques. GRAPE succeeds in generating the complex programs ...
Solving the Graph Planarization Problem Using an Improved Genetic Algorithm
An improved genetic algorithm for solving the graph planarization problem is presented. The improved genetic algorithm which is designed to embed a graph on a plane, performs crossover and mutation conditionally instead of probability. The improved ...
Comments