Skip to main content

Clonal and Cauchy-mutation Evolutionary Algorithm for Global Numerical Optimization

  • Conference paper
Advances in Computation and Intelligence (ISICA 2009)

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

Included in the following conference series:

Abstract

Many real-life problems can be formulated as numerical optimization of certain objective functions. However, for an objective function possesses numerous local optima, many evolutionary algorithms (EAs) would be trapped in local solutions. To improve the search efficiency, this paper presents a clone and Cauchy-mutation evolutionary algorithm (CCEA), which employs dynamic clone and Cauchy mutation methods, for numerical optimization. For a suit of 23 benchmark test functions, CCEA is able to locate the near-optimal solutions for almost 23 test functions with relatively small variance. Especially, for f 14-f 23, CCEA can get better solutions than other algorithms.

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., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Institute to Physics Publishing (1997)

    Google Scholar 

  2. Michalewicz, Z.: Genetic algorithms + data structures = evolution programs, 2nd edn. Springer, New York (1994)

    Book  MATH  Google Scholar 

  3. Gehlhaar, D.K., Fogel, D.B.: Tuning evolutionary programming for conformationally flexible molecular docking. In: Fogel, L.J., Angeline, P.J., Bäck, T. (eds.) Evolutionary Programming V: Proc. Of the Fifth Annual Conference on Evolutionary Programming, pp. 419–429. MIT Press, Cambridge (1996)

    Google Scholar 

  4. Yao, X., Liu, Y., Lin, G.M.: Fast evolutionary strategy. In: Angeline, P.J., Reynods, R., McDonnell, J., Eberhart, R. (eds.) Proc. Evolutionary Programming VI, pp. 151–161 (1997)

    Google Scholar 

  5. Chellapilla, K.: Combining mutation operators in evolutionary programming. IEEE Trans. Evol. Comput. 2, 91–98 (1998)

    Article  Google Scholar 

  6. Yao, X., Liu, Y., Lin, G.M.: Evolutionary programming made faster. IEEE Trans. on Evolutionary Computation 3, 82–102 (1999)

    Article  Google Scholar 

  7. Angeline, P.J.: Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds.) Proc. Evolutionary Programming VII, pp. 601–610 (1998)

    Google Scholar 

  8. Tu, Z., Lu, Y.: A robust stochastic genetic algorithm (stga) for global numerical optimization. IEEE Trans. on Evolutionary Computation 8(5), 456–470 (2004)

    Article  Google Scholar 

  9. André, V., da Curz, A., Vellasco, M.M.B.R.: Quantum-Inspired Evolutionary Algorithm for Numerical Optimization. In: 2006 IEEE Congress on Evolutionary Computation, pp. 9181–9187 (2006)

    Google Scholar 

  10. Clerc, M., Kennedy, J.: The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. on Evolutionary Computation 6(1), 58–73 (2002)

    Article  Google Scholar 

  11. Parsopoulos, K.E., Vrahatis, M.N.: Recent approaches to global optimization problems through particle swarm optimization. Natural Computing, 235–306 (2002)

    Google Scholar 

  12. Andrews, P.S.: An Investigation into Mutation Operators for Particle Swarm Optimization. In: 2006 IEEE Congress on Evolutionary Computation, pp. 3789–3796 (2006)

    Google Scholar 

  13. Storn, R., Price, K.V.: Differential evolution-A simple and Efficient Heuristic for Global Optimization over Continuous Spaces. Journal of Global Optimization 11, 341–359 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lampinen, J., Zelinka, I.: Mixed Variable Non-linear Optimization by Differential Evolution. In: Proceedings of Nostradamus 1999 2nd International Prediction Conference, pp. 45–55 (1999)

    Google Scholar 

  15. Price, K., Storm, R., Lampinen, J.: Differential Evolution-A Practical Approach to Global Optimization. Springer, Heidelberg (2005)

    Google Scholar 

  16. Feller, W.: An Introduction to Probability Theory and Its Applications, 2nd edn., vol. 2, p. 51. John Wiley & Sons, Inc., Chichester (1971)

    Google Scholar 

  17. Törn, A., Žilinskas, A.: Global Optimization. LNCS, vol. 350. Springer, Heidelberg (1989)

    MATH  Google Scholar 

  18. Schwefel, H.P.: Evolution and Optimum Seeking. Wiley, New York (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guan, J., Yang, M. (2009). Clonal and Cauchy-mutation Evolutionary Algorithm for Global Numerical Optimization. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2009. Lecture Notes in Computer Science, vol 5821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04843-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04843-2_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04842-5

  • Online ISBN: 978-3-642-04843-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics