Skip to main content

Fast evolution strategies

  • Issues in Evolutionary Optimization
  • Conference paper
  • First Online:
Evolutionary Programming VI (EP 1997)

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

Included in the following conference series:

Abstract

Evolution strategies are a class of general optimisation algorithms which are applicable to functions that are multimodal, non-differentiable, or even discontinuous. Although recombination operators have been introduced into evolution strategies, their primary search operator is still mutation. Classical evolution strategies rely on Gaussian mutations. A new mutation operator based on the Cauchy distribution is proposed in this paper. It is shown empirically that the new evolution strategy based on Cauchy mutation outperforms the classical evolution strategy on most of the 23 benchmark problems tested in this paper. These results, along with those obtained by fast evolutionary programming

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

  1. X. Yao and Y. Liu, “Fast evolutionary programming,” in Evolutionary Programming V: Proc. of the Fifth Annual Conference on Evolutionary Programming (L. J. Fogel, P. J. Angeline, and T. Bäck, eds.), MIT Press, Cambridge, MA, 1996.

    Google Scholar 

  2. D. B. Fogel, “An introduction to simulated evolutionary optimisation,” IEEE Trans. on Neural Networks, vol. 5, no. 1, pp. 3–14, 1994.

    Article  Google Scholar 

  3. T. Bäck and H.-P. Schwefel, “An overview of evolutionary algorithms for parameter optimization,” Evolutionary Computation, vol. 1, no.1, pp. 1–23, 1993.

    Google Scholar 

  4. H.-P. Schwefel, Evolution and Optimum Seeking. New York: John Wiley & Sons, 1995.

    Google Scholar 

  5. T. Bäck and H.-P. Schwefel, “Evolutionary computation: an overview,” in Proc. of the 1996 IEEE Int'l Conf. on Evolutionary Computation (ICEC'96), Nagoya, Japan, pp. 20–29, IEEE Press, New York, NY 10017–2394, 1996.

    Google Scholar 

  6. X. Yao, “An overview of evolutionary computation,” Chinese Journal of Advanced Software Research (Allerton Press, Inc., New York, NY 10011), vol. 3, no. 1, pp. 12–29, 1996.

    Google Scholar 

  7. T. Bäck, Evolutionary Algorithms in Theory and Practice. New York: Oxford University Press, 1996.

    Google Scholar 

  8. C. Kappler, “Are evolutionary algorithms improved by large mutations?,” in Parallel Problem Solving from Nature (PPSN) IV (H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, eds.), vol. 1141 of Lecture Notes in Computer Science, (Berlin), pp. 346–355, Springer-Verlag, 1996.

    Google Scholar 

  9. H. H. Szu and R. L. Hartley, “Nonconvex optimization by fast simulated annealing,” Proceedings of IEEE, vol. 75, pp. 1538–1540, 1987.

    Google Scholar 

  10. X. Yao, “A new simulated annealing algorithm,” Int. J. of Computer Math., vol. 56, pp. 161–168, 1995.

    Google Scholar 

  11. D. K. Gehlhaar and D. B. Fogel, “Tuning evolutionary programming for conformationally flexible molecular docking,” in Evolutionary Programming V: Proc. of the Fifth Annual Conference on Evolutionary Programming (L. J. Fogel, P. J. Angeline, and T. Bäck, eds.), MIT Press, Cambridge, MA, 1996.

    Google Scholar 

  12. W. Feller, An Introduction to Probability Theory and Its Applications, vol. 2. John Wiley & Sons, Inc., 2nd ed., 1971.

    Google Scholar 

  13. D. B. Fogel, System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling. Needham Heights, MA 02194: Ginn Press, 1991.

    Google Scholar 

  14. A. Törn and A. Zilinskas, Global Optimisation. Berlin: Springer-Verlag, 1989. Lecture Notes in Computer Science, Vol. 350.

    Google Scholar 

  15. L. Ingber and B. Rosen, “Genetic algorithms and very fast simulated reannealing: a comparison,” Mathl. Comput. Modelling, vol. 16, no. 11, pp. 87–100, 1992.

    Article  Google Scholar 

  16. A. Dekkers and E. Aarts, “Global optimization and simulated annealing,” Math. Programming, vol. 50, pp. 367–393, 1991.

    Article  Google Scholar 

  17. D. B. Fogel, Evolutionary Computation: Towards a New Philosophy of Machine Intelligence. New York, NY: IEEE Press, 1995.

    Google Scholar 

  18. X. Yao, Y. Liu, and G. Lin, “Evolutionary programming made faster,” IEEE Transactions on Evolutionary Computation, 1996. Submitted.

    Google Scholar 

  19. G. Lin and X. Yao, “Analysing the impact of the number of crossover points in genetic algorithms,” IEEE Transactions on Evolutionary Computation, 1996. Submitted.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Peter J. Angeline Robert G. Reynolds John R. McDonnell Russ Eberhart

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yao, X., Liu, Y. (1997). Fast evolution strategies. In: Angeline, P.J., Reynolds, R.G., McDonnell, J.R., Eberhart, R. (eds) Evolutionary Programming VI. EP 1997. Lecture Notes in Computer Science, vol 1213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014808

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62788-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics