Skip to main content
SpringerLink
Log in

A preliminary investigation into directed mutations in evolutionary algorithms

  • Modifications and Extensions of Evolutionary Algorithms Genetic Operators and Problem Representation
  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN IV (PPSN 1996)

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

Included in the following conference series:

Abstract

The traditional mutation operator within evolution strategies and evolutionary programming relies on adding a multivariate zero mean Gaussian random vector to each parent solution. An alternative method is proposed that allows for optimizing the direction of such mutations. The notion of mutation in polar coordinates is adopted such that parents generate offspring in a selected direction with a random step size. Experiments on four functions suggest that the independent adjustment of direction of travel and step size can produce improvements in rate of convergence on some functions.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • T. Bäck (1996) Evolutionary Algorithms in Theory and Practice, Oxford, NY.

    Google Scholar 

  • T. Bäck, F. Hoffmeister, and H.-P. Schwefel (1991) “A Survey of Evolution Strategies,” Proc. of the Fourth Intern. Conf. on Genetic Algorithms, R.K. Belew and L.B. Booker (eds.), Morgan Kaufmann, San Mateo, CA, pp. 2–9.

    Google Scholar 

  • H.J. Bremermann and M. Rogson (1964) “An evolution-type search method for convex sets,” ONR Tech. Report, Contracts 222(85) and 3656(58), Berkeley, CA.

    Google Scholar 

  • H.J. Bremermann, M. Rogson, and S. Salaff (1965) “Search by evolution,” Biophysics and Cybernetic Systems, M. Maxfield, A. Callahan, and L.J. Fogel (eds.), Spartan Books, Washington D.C., pp. 157–167.

    Google Scholar 

  • H.J. Bremermann, M. Rogson, and S. Salaff (1968) “Global properties of evolution processes,” Natural Automata and Useful Simulations (Proceedings of 1966 conference), H.H. Pattee, E.A. Edlsack, L. Fein, and A.B. Callahan, Spartan Books, Washington D.C., pp. 3–41.

    Google Scholar 

  • I.O. Bohachevsky, M.E. Johnson, M.L. Smith (1986) “Generalized Simulated Annealing for Function Optimization,” Technometrics, Vol. 28:3, pp. 209–217.

    Google Scholar 

  • K.A. De Jong (1975) “The Analysis of the Behavior of a Class of Genetic Adaptive Systems,” Ph.D. Dissertation, Univ. of Michigan, Ann Arbor.

    Google Scholar 

  • D.B. Fogel and J.W. Atmar (1990) “Comparing Genetic Operators with Gaussian Mutations in Simulated Evolutionary Processes Using Linear Systems,” Biological Cybernetics, Vol. 63, pp. 111–114.

    Google Scholar 

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

    Google Scholar 

  • D.B. Fogel, L.J. Fogel, W. Atmar, and G.B. Fogel (1992) “Hierarchic Methods of Evolutionary Programming,” Proc. of the First Annual Conference on Evolutionary Programming, D.B. Fogel and W. Atmar (eds.), Evolutionary Programming Society, La Jolla, CA, pp. 175–182.

    Google Scholar 

  • A. Ostermeier (1992) “An Evolution Strategy with Momentum Adaptation of the Random Number Distribution, “Parallel Problem Solving from Nature, 2, R. Männer and B. Manderick (eds.), North-Holland, Amsterdam, pp. 197–206.

    Google Scholar 

  • I. Rechenberg (1973) Evolutionsstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution. Stuttgart: Formman-Holzboog Verlag.

    Google Scholar 

  • N. Saravanan, D.B. Fogel, and K.M. Nelson (1995) “A Comparison of Methods for Self-Adaptation in Evolutionary Algorithms,” BioSystems, Vol. 36, pp. 157–166.

    Article  PubMed  Google Scholar 

  • H.-P. Schwefel (1981) Numerical Optimization of Computer Models, John Wiley, Chichester, U.K.

    Google Scholar 

  • M.A. Schumer and K. Steiglitz (1968) “Adaptive Step Size Random Search,” IEEE Trans. on Auto. Control, Vol. 13, pp. 270–276.

    Article  Google Scholar 

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

    Google Scholar 

  • H.-M. Voigt and T. Anheyer (1994) “Modal Mutations in Evolutionary Algorithms,” Proc. of the 1st IEEE Conference on Evolutionary Computation, IEEE Press, pp. 88–92.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Natural Selection, Inc., 3333 N. Torrey Pines Ct., Suite 200, 92037, La Jolla, CA

    Adam Ghozeil & David B. Fogel

Authors
  1. Adam Ghozeil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David B. Fogel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans-Michael Voigt Werner Ebeling Ingo Rechenberg Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghozeil, A., Fogel, D.B. (1996). A preliminary investigation into directed mutations in evolutionary algorithms. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_997

Download citation

  • DOI: https://doi.org/10.1007/3-540-61723-X_997

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61723-5

  • Online ISBN: 978-3-540-70668-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation