Skip to main content

Multi-Dimensional Gaussian and Cauchy Mutations

  • Conference paper
Intelligent Information Systems 2001

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 10))

Abstract

The aim of this work is to focus the attention of researchers concerned with evolutionary algorithms on the fact that the most probable location of the mutated points in multi-dimensional Gaussian and Cauchy mutations is not in a close neighborhood of the origin, but at a certain distance from it. In the case of the Gaussian mutation this distance is proportional to the norm of the standard deviation vector and increases with the landscape dimension. This may cause a decrease in the sensitivity of the evolutionary algorithm to narrow peaks when the landscape dimension increases. Moreover, it is proved that the multi-dimensional Cauchy mutation is not isotropic and the directions parallel to the axes of the reference frame are preferred. The effectiveness of the evolutionary algorithm using the Cauchy mutation strongly depends on the choice of the reference frame. New Gaussian-like and Cauchy-like mutations are proposed in order to overcome the considered difficulties.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bäck, T., Fogel, D.B., and Michalewicz, Z., (Eds.) Handbook of Evolutionary Computation. Institute of Physics Publishing and Oxford University Press, NY, 1997.

    Book  MATH  Google Scholar 

  2. Fogel, L.J., Owens, A.J., and Walsh, M.J., Artificial Intelligence through Simulated Evolution. Wiley, NY, 1966.

    Google Scholar 

  3. Galar, R., Handicapped individua in evolutionary processes. Biological Cybernetics, Vol. 51, 1985, pp. 1 - 9.

    Article  Google Scholar 

  4. Michalewicz, Z., Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin Heidelberg, 1996.

    Book  MATH  Google Scholar 

  5. Rechenberg, I., Cybernetic solution path of an experimental problem. Roy. Aircr. Establ., libr. Transl. 1122, Farnborough, Hants., UK, 1965.

    Google Scholar 

  6. Yao, X., and Liu, Y., Fast evolutionary programming. Evolutionary Programming V: Proc. 5th Annual Conference on Evolutionary Programming, L.J. Fogel, P.J. Angeline, and T. Bäck, Eds. Cambridge, MIT Press, MA, 1996, pp. 419 - 429.

    Google Scholar 

  7. Yao, X., and Liu, Y., Evolutionary programming made faster. IEEE Trans. on Evolutionary Computation, Vol. 3, No. 2, 1999, pp. 82 - 102.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Obuchowicz, A. (2001). Multi-Dimensional Gaussian and Cauchy Mutations. In: Kłopotek, M.A., Michalewicz, M., Wierzchoń, S.T. (eds) Intelligent Information Systems 2001. Advances in Intelligent and Soft Computing, vol 10. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1813-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1813-0_12

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-1407-1

  • Online ISBN: 978-3-7908-1813-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics