Skip to main content

What is Needed to Promote an Asynchronous Program Evolution in Genetic Programing?

  • Conference paper
  • First Online:
  • 1114 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8426))

Abstract

Unlike a synchronous program evolution in the context of evolutionary computation that evolves individuals (i.e., programs) after evaluations of all individuals in each generation, this paper focuses on an asynchronous program evolution that evolves individuals during evaluations of each individual. To tackle this problem, we explore the mechanism that can promote an asynchronous program evolution by selecting a good individual without waiting for evaluations of all individuals, and investigates its effectiveness in genetic programming (GP) domain. The intensive experiments have revealed the following implications: (1) the program asynchronously evolved with the proposed mechanism can be completed with the shorter execution steps than the program asynchronously evolved without the proposed mechanism; and (2) the program asynchronously evolved with the proposed mechanism can be completed with mostly the same or shorter execution steps than the program synchronously evolved by the conventional GP.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Banzhaf, W., Francone, F.D., Keller, R.E., Nordin, P.: Genetic Programming: An Introduction: on the Automatic Evolution of Computer Programs and Its Applications. Morgan Kaufmann Publishers Inc., San Francisco (1998)

    MATH  Google Scholar 

  2. Brameier, M.F., Banzhaf, W.: Linear Genetic Programming, vol. 117. Springer, New York (2007)

    MATH  Google Scholar 

  3. Glasmachers, T.: A natural evolution strategy with asynchronous strategy updates. In: The Fifteenth Annual Conference on Genetic and Evolutionary Computation Conference (GECCO 2013), pp. 431–438. ACM (2013)

    Google Scholar 

  4. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co. Inc., Boston (1989)

    MATH  Google Scholar 

  5. Harada, T., Otani, M., Matsushima, H., Hattori, K., Sato, H., Takadama, K.: Robustness to bit inversion in registers and acceleration of program evolution in on-board computer. J. Adv. Comput. Intell. Intell. Inf. (JACIII) 15(8), 1175–1185 (2011)

    Google Scholar 

  6. Harada, T., Otani, M., Matsushima, H., Hattori, K., Takadama, K.: Evolving complex programs in tierra-based on-board computer on UNITEC-1. In: 2010 61st World Congress on International Astronautical Congress (IAC) (2010)

    Google Scholar 

  7. Koza, J.: Genetic Programming on the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  8. Langton, C.G.: Artificial Life. Addison-Wesley, Redwood City (1989)

    Google Scholar 

  9. Lewis, A., Mostaghim, S., Scriven, I.: Asynchronous multi-objective optimisation in unreliable distributed environments. In: Lewis, A., Mostaghim, S., Randall, M. (eds.) Biologically-Inspired Optimisation Methods. SCI, vol. 210, pp. 51–78. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Microchip Technology Inc.: PIC10F200/202/204/206 Data Sheet 6-Pin, 8-bit Flash Microcontrollers. Microchip Technology Inc. (2007). http://ww1.microchip.com/downloads/en/DeviceDoc/41239D.pdf

  11. Nonami, K., Takadama, K.: Tierra-based space system for robustness of bit inversion and program evolution. In: SICE 2007 Annual Conference, pp. 1155–1160 (2007)

    Google Scholar 

  12. Ray, T.S.: An approach to the synthesis of life. In: Langton, C.G., Taylor, C., Farmer, J.D., Rasmussen, S. (eds.) Artificial Life II, vol. XI, pp. 371–408. Addison-Wesley, Redwood City (1991)

    Google Scholar 

  13. Reynolds, C.W.: An evolved, vision-based behavioral model of coordinated group motion. In: 2nd International Conference on Simulation of Adaptive Behavior, pp. 384–392. MIT Press (1993)

    Google Scholar 

  14. Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997). http://dx.doi.org/10.1023/A:1008202821328

    Article  MATH  MathSciNet  Google Scholar 

  15. Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Keiki Takadama .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Takadama, K., Harada, T., Sato, H., Hattori, K. (2014). What is Needed to Promote an Asynchronous Program Evolution in Genetic Programing?. In: Pardalos, P., Resende, M., Vogiatzis, C., Walteros, J. (eds) Learning and Intelligent Optimization. LION 2014. Lecture Notes in Computer Science(), vol 8426. Springer, Cham. https://doi.org/10.1007/978-3-319-09584-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09584-4_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09583-7

  • Online ISBN: 978-3-319-09584-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics