skip to main content
10.1145/1276958.1277290acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

Graph structured program evolution

Published: 07 July 2007 Publication History

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.

References

[1]
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.
[2]
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.
[3]
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.
[4]
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.
[5]
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.
[6]
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.
[7]
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.
[8]
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.
[9]
J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
[10]
J. R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge, MA, USA, 1994.
[11]
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.
[12]
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.
[13]
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.
[14]
D. J. Montana. Strongly typed genetic programming. Evolutionary Computation, 3(2):199--230, 1995.
[15]
M. O'Neill and C. Ryan. Grammatical evolution. IEEE Transactions on Evolutionary Computation, 5(4):349--358, Aug. 2001.
[16]
M. O'Neill and C. Ryan. Grammatical Evolution: Evolutionary Automatic Programming in a Arbitrary Language, volume 4 of Genetic programming. Kluwer Academic Publishers, 2003.
[17]
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.
[18]
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.
[19]
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.
[20]
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.
[21]
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
[22]
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.
[23]
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.
[24]
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.
[25]
A. Teller and M. Veloso. Program evolution for data mining. The International Journal of Expert Systems, 8(3):216--236, 1995.
[26]
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.
[27]
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.

Cited By

View all
  • (2023)A Comprehensive Survey on Program Synthesis With Evolutionary AlgorithmsIEEE Transactions on Evolutionary Computation10.1109/TEVC.2022.316232427:1(82-97)Online publication date: Feb-2023
  • (2021)Procedural Content Generation of Levels with Increased Connectedness using Complex String Generators2021 IEEE Symposium Series on Computational Intelligence (SSCI)10.1109/SSCI50451.2021.9660059(1-8)Online publication date: 5-Dec-2021
  • (2021)Evolutionary Acquisition of Multiple TTSP Graph Patterns with Wildcards by Clustering TTSP Graphs2021 IEEE 12th International Workshop on Computational Intelligence and Applications (IWCIA)10.1109/IWCIA52852.2021.9626029(1-8)Online publication date: 6-Nov-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation
July 2007
2313 pages
ISBN:9781595936974
DOI:10.1145/1276958
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Fibonacci sequence
  2. automatic programming
  3. exponentiation
  4. factorial
  5. genetic algorithm
  6. genetic programming
  7. graph-based genetic programming
  8. reversing a list

Qualifiers

  • Article

Conference

GECCO07
Sponsor:

Acceptance Rates

GECCO '07 Paper Acceptance Rate 266 of 577 submissions, 46%;
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)A Comprehensive Survey on Program Synthesis With Evolutionary AlgorithmsIEEE Transactions on Evolutionary Computation10.1109/TEVC.2022.316232427:1(82-97)Online publication date: Feb-2023
  • (2021)Procedural Content Generation of Levels with Increased Connectedness using Complex String Generators2021 IEEE Symposium Series on Computational Intelligence (SSCI)10.1109/SSCI50451.2021.9660059(1-8)Online publication date: 5-Dec-2021
  • (2021)Evolutionary Acquisition of Multiple TTSP Graph Patterns with Wildcards by Clustering TTSP Graphs2021 IEEE 12th International Workshop on Computational Intelligence and Applications (IWCIA)10.1109/IWCIA52852.2021.9626029(1-8)Online publication date: 6-Nov-2021
  • (2019)Using Label Information in a Genetic Programming Based Method for Acquiring Block Preserving Outerplanar Graph Patterns with Wildcards2019 IEEE 11th International Workshop on Computational Intelligence and Applications (IWCIA)10.1109/IWCIA47330.2019.8955031(95-100)Online publication date: Nov-2019
  • (2018)Acquisition of characteristic sets of block preserving outerplanar graph patterns by a two-stage evolutionary learning method for graph pattern setsInternational Journal of Computational Intelligence Studies10.5555/3302649.33026557:3-4(270-288)Online publication date: 1-Jan-2018
  • (2018)Controlling an Autonomous Agent for Exploring Unknown Environments using Switching Prelearned ModulesIEEJ Transactions on Electronics, Information and Systems10.1541/ieejeiss.138.157138:2(157-164)Online publication date: 2018
  • (2018)Aggregative context-aware fitness functions based on feature selection for evolutionary learning of characteristic graph patternsVietnam Journal of Computer Science10.1007/s40595-018-0118-85:3-4(229-239)Online publication date: 1-Sep-2018
  • (2018)Controlling an Autonomous Agent for Exploring Unknown Environments Using Switching Prelearned ModulesElectronics and Communications in Japan10.1002/ecj.12068101:5(84-93)Online publication date: 6-Apr-2018
  • (2017)Acquisition of multiple block preserving outerplanar graph patterns by an evolutionary method for graph pattern sets2017 IEEE 10th International Workshop on Computational Intelligence and Applications (IWCIA)10.1109/IWCIA.2017.8203583(191-197)Online publication date: Nov-2017
  • (2017)Acquisition of Multiple Graph Structured Patterns by an Evolutionary Method Using Sets of TTSP Graph Patterns as Individuals2017 6th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)10.1109/IIAI-AAI.2017.198(459-464)Online publication date: Jul-2017
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media