Skip to main content

An introduction to evolutionary programming

  • Invited Papers
  • Conference paper
  • First Online:
Artificial Evolution (AE 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1063))

Included in the following conference series:

Abstract

Evolutionary programming is a method for simulating evolution that has been investigated for over 30 years. This paper offers an introduction to evolutionary programming, and indicates its relationship to other methods of evolutionary computation, specifically genetic algorithms and evolution strategies. The original efforts that evolved finite state machines for predicting arbitrary time series, as well as specific recent efforts in combinatorial and continuous optimization are reviewed. Some areas of current investigation are mentioned, including empirical assessment of the optimization performance of the technique and extensions of the method to include mechanisms to self-adapt to the error surface being searched.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • B.K. Ambati, J. Ambati, and M.M. Mokhtar (1991) “Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the traveling salesman problem,” Biological Cybernetics, Vol. 65, pp. 31–35.

    Article  Google Scholar 

  • P.J. Angeline, G.M. Saunders and J.B. Pollack (1994) “An evolutionary algorithm that constructs recurrent neural networks,” IEEE Transactions on Neural Networks, Vol. 5, pp. 54–65.

    Google Scholar 

  • W. Atmar (1994) “Notes on the simulation of evolution,” IEEE Transactions on Neural Networks, Vol. 5, pp. 130–148.

    Google Scholar 

  • R. Axelrod (1987) “The evolution of strategies in the iterated prisoner's dilemma,” Genetic Algorithms and Simulated Annealing, L. Davis (ed.), Pitman, London, pp. 32–42.

    Google Scholar 

  • R. Axelrod (1984) The Evolution of Cooperation, Basic Books, NY.

    Google Scholar 

  • T. Bäck and H.-P. Schwefel (1993) “An overview of evolutionary algorithms for parameter optimization,” Evolutionary Computation, Vol. 1:1, pp. 1–24.

    Google Scholar 

  • T. Bäck (1995) Evolutionary Algorithms in Theory and Practice, IOP Press, Philadelphia, PA, in press.

    Google Scholar 

  • H.J. Bremermann (1966) “Numerical optimization procedures derived from biological evolution processes,” Cybernetic Problems in Bionics, H.L. Oestreicher and D.R. Moore (eds.), Gordon and Breach, London, pp. 543–562.

    Google Scholar 

  • T.W. Brotherton and P.K. Simpson (1995) “Dynamic Feature Set Training of Neural Nets for Classification,” Evolutionary Programming IV: Proceedings of the Fourth Annual Conference on Evolutionary Programming, J.R. McDonnell, R.G. Reynolds, and D.B. Fogel (eds.), MIT Press, Cambridge, MA, 1995, pp. 83–94.

    Google Scholar 

  • M. Conrad and M.M. Rizki (1989) “The artificial worlds approach to emergent evolution,” BioSystems, Vol. 23, pp. 247–260.

    PubMed  Google Scholar 

  • D.B. Fogel (1988) “An evolutionary approach to the traveling salesman problem,” Biological Cybernetics, Vol. 60, pp. 139–144.

    Google Scholar 

  • D.B. Fogel (1991a) “An information criterion for optimal neural network selection,” IEEE Transactions on Neural Networks, Vol. 2, 1991, pp. 490–497.

    Google Scholar 

  • D.B. Fogel (1991b) “The evolution of intelligent decision making in gaming,” Cybernetics and Systems, Vol. 22, pp. 223–236.

    Google Scholar 

  • D.B. Fogel (1993a) “On the philosophical differences between evolutionary algorithms and genetic algorithms,” Proceedings of the Second Annual Conference on Evolutionary Programming, D.B. Fogel and W. Atmar (eds.), Evolutionary Programming Society, La Jolla, CA, pp. 23–29.

    Google Scholar 

  • D.B. Fogel (1993b) “Applying evolutionary programming to selected traveling salesman problems,” Cybernetics and Systems, Vol. 24, pp. 27–36.

    MathSciNet  Google Scholar 

  • D.B. Fogel (1993c) “Empirical estimation of the computation required to discover approximate solutions to the traveling salesman problem using evolutionary programming,” Proceedings of the Second Annual Conference on Evolutionary Programming, D.B. Fogel and W. Atmar (eds.), Evolutionary Programming Society, La Jolla, CA, pp. 56–61.

    Google Scholar 

  • D.B. Fogel (1993d) “Evolving behaviors in the iterated prisoner's dilemma,” Evolutionary Computation, Vol. 1, pp. 77–97.

    Google Scholar 

  • D.B. Fogel (1994a) “An introduction to simulated evolutionary optimization,” IEEE Transactions on Neural Networks, Vol. 5:1, pp. 3–14.

    Google Scholar 

  • D.B. Fogel (1994b) “Applying evolutionary programming to selected control problems,” Comp. Math. Applic., Vol 27:11, pp. 89–104.

    Google Scholar 

  • D.B. Fogel (1995a) Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, IEEE Press, Piscataway, NJ.

    Google Scholar 

  • D.B. Fogel (1995b) “On the relationship between the duration of an encounter and the evolution of cooperation in the iterated prisoner's dilemma,” Evolutionary Computation, in press.

    Google Scholar 

  • D.B. Fogel, L.J. Fogel and V.W. Porto (1990) “Evolving neural networks,” Biological Cybernetics, Vol. 63, pp. 487–493.

    Google Scholar 

  • D.B. Fogel and L.C. Stayton (1994c) “On the effectiveness of crossover in simulated evolutionary optimization,” BioSystems, Vol 32:3, pp. 171–182.

    PubMed  Google Scholar 

  • D.B. Fogel and J.W. Atmar (1990) “Comparing genetic operators with Gaussian mutations in simulated evolutionary processing using linear systems,” Biological Cybernetics, Vol. 63, pp. 111–114.

    Google Scholar 

  • D.B. Fogel, L.J. Fogel and J.W. Atmar (1991) “Meta-evolutionary programming,” Proc. of the Asilomar Conf. on Signals, Systems and Computers, R.R. Chen (ed.), Maple Press, San Jose, CA, pp. 540–545.

    Google Scholar 

  • L.J. Fogel (1962) “Autonomous automata,” Industrial Research, Vol. 4, pp. 14–19.

    Google Scholar 

  • L.J. Fogel, A.J. Owens and M.J. Walsh (1966) Artificial Intelligence through Simulated Evolution, John Wiley, NY.

    Google Scholar 

  • R. Galar (1991) “Simulation of local evolutionary dynamics of small populations,” Biological Cybernetics, Vol. 65, pp. 37–45.

    PubMed  Google Scholar 

  • D.E. Goldberg (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.

    Google Scholar 

  • D.E. Goldberg (1994) “Genetic and evolutionary algorithms come of age,” Communications of the ACM, Vol. 37, pp. 113–119.

    Google Scholar 

  • D.E. Goldberg and R. Lingle (1985) “Alleles, Loci, and the Traveling Salesman Problem,” Proceedings of an International Conference on Genetic Algorithms and Their Applications, J.J. Grefenstette (ed.), pp. 154–159.

    Google Scholar 

  • P.G. Harrald and D.B. Fogel (1995) “Evolving continuous behaviors in the iterated prisoner's dilemma,” BioSystems, in press.

    Google Scholar 

  • J.H. Holland (1975) Adaptation in Natural and Artificial Systems, Univ. of Michigan Press, Ann Arbor, MI.

    Google Scholar 

  • K. Kinnear (1993) “Evolving a sort: lessons in genetic programming” IEEE International Conference on Neural Networks 1993, IEEE Press, Piscataway, NJ.

    Google Scholar 

  • J.R. Koza (1992) Genetic Programming, MIT Press, Cambridge, MA.

    Google Scholar 

  • K. Lindgren (1991) “Evolutionary phenomena in simple dynamics,” Artificial Life II, C.G. Langton, C. Taylor, J.D. Farmer and S. Rasmussen (eds.), Addison-Wesley, Reading, MA, pp. 295–312.

    Google Scholar 

  • J.R. McDonnell and D. Waagen (1993) “Neural network structure design by evolutionary programming,” Proceedings of the Second Annual Conference on Evolutionary Programming, D.B. Fogel and W. Atmar (eds.), Evolutionary Programming Society, La Jolla, CA, pp. 79–89.

    Google Scholar 

  • J.R. McDonnell and D. Waagen (1994) “Evolving recurrent perceptrons for time-series modeling,” IEEE Transactions on Neural Networks, Vol. 5, pp. 24–38.

    Google Scholar 

  • H. Mühlenbein (1992) “Evolution in time and space — the parallel genetic algorithm,” Foundations of Genetic Algorithms, G.J.E. Rawlins (ed.), Morgan Kaufmann, San Mateo, CA, pp. 316–337.

    Google Scholar 

  • T. Ray (1991) “An approach to the synthesis of life,” Artificial Life II, C.G. Langton, C. Taylor, J.D. Farmer and S. Rasmussen (eds.), Addison-Wesley, Reading, MA, pp. 371–408.

    Google Scholar 

  • I. Rechenberg (1965) “Cybernetic solution path of an experimental problem,” Royal Aircraft Establishment, Library Translation No. 1122, August.

    Google Scholar 

  • N. Saravanan and D.B. Fogel (1994) “Learning strategy parameters in evolutionary programming: an empirical study,” Proc. of the Third Annual Conference on Evolutionary Programming, A.V. Sebald and L.J. Fogel (eds.), World Scientific, River Edge, NJ, pp. 269–280.

    Google Scholar 

  • J.D. Schaffer and L. Eshelman (1991) “On crossover as an evolutionarily viable strategy,” Proc. of the Fourth Intern. Conf. on Genetic Algorithms, R.K. Belew and L.B. Booker (eds.), Morgan Kaufmann, San Mateo, CA, pp. 61–68.

    Google Scholar 

  • H.-P. Schwefel (1981) Numerical Optimization of Computer Models, Chichester, UK.

    Google Scholar 

  • H.-P. Schwefel (1995) Evolution and Optimum Seeking, John Wiley, NY.

    Google Scholar 

  • E.A. Stanley, D. Ashlock and L. Tesfatsion (1994) “Iterated prisoner's dilemma with choice and refusal of partners,” Artificial Life III, C.G. Langton (ed.), Addison-Wesley, Reading, MA, pp. 131–175

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jean-Marc Alliot Evelyne Lutton Edmund Ronald Marc Schoenauer Dominique Snyers

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fogel, D.B., Fogel, L.J. (1996). An introduction to evolutionary programming. In: Alliot, JM., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds) Artificial Evolution. AE 1995. Lecture Notes in Computer Science, vol 1063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61108-8_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-61108-8_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61108-0

  • Online ISBN: 978-3-540-49948-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics