Skip to main content
Log in

Genetic Programming with simple loops

  • Notes
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A kind of loop function LoopN in Genetic Programming (GP) is proposed. Different from other forms of loop function, such as While-Do and Repeat-Until, LoopN takes only one argument as its loop body and makes its loop body simply runN times, so infinite loops will never happen. The problem of how to avoid too many layers of loops in Genetic Programming is also solved. The advantage of LoopN in GP is shown by the computational results in solving the mower problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Koza J R. Genetic Programming I, On the Programming of Computers by means of Natural Selection. Cambridge, MA: MIT Press, 1992.

    Google Scholar 

  2. Koza J R. Genetic Programming II, Automatic Discovery of Reusable Programs. Cambridge, MA: MIT Press, 1994.

    MATH  Google Scholar 

  3. Liu Yong, Kang Lishan, Chen Yuping. Nonnumeric Parallel Algorithm, (Book II). Genetic Algorithm, Science Publishing House, 1995.

  4. Montana D J. Strongly Typed Genetic Programming.Evolutionary Computation, 1995, 3(2).

  5. Kenneth E. Kinnear Jr. Evolving a sort: Lessons in genetic programming. InProceedings of the 1993 International Conference on Neural Networks, Volume 2, San Francisco, USA, 1993, IEEE Press.

  6. Nichael Lynn Cramer. A representation for the adaptive generation of simple sequential programs. InProceedings of an International Conference on Genetic Algorithms and the Applications, Grefenstette John J, (ed.), Carnegie-Mellon University, Pittsburgh, PA, USA July 24–26 1985, pp. 183–187.

    Google Scholar 

  7. Astro Teller, Genetic programming, indexed memory, the halting problem, and other curiosities. InProceedings of the 7th Annual Florida Artificial Intelligence Research Symposium, pp. 270–274, Pensacola, Florida, USA, May 1994. IEEE Press.

  8. Peter Nordin, Wolfgang Banzhaf. Evolving turing-complete programs for a register machine with selfmodifying code. InGenetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), Eshelman E (ed.), pp.318–325, Pittsburgh, PA, USA, July 15–19, 1995.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qi Yuesheng.

Additional information

This paper is supported by the National Natural Science Foundation (No. 69635030) and National ‘863’ Hi-Tech Programme of China

QI Yuesheng was born in 1966. He is now a Ph.D. candidate of computer science. His research interests are evolutionary computation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Qi, Y., Wang, B. & Kang, L. Genetic Programming with simple loops. J. Comput. Sci. & Technol. 14, 429–433 (1999). https://doi.org/10.1007/BF02948747

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948747

Keywords

Navigation