Skip to main content

Investigation of Genetic Algorithms with Self-Adaptive Crossover, Mutation, and Selection

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6678))

Abstract

A method of self-adaptive mutation, crossover and selection was implemented and applied in four genetic algorithms. So developed self-adapting algorithms were then compared, with respect to convergence, with a traditional genetic one, which contained constant rates of mutation and crossover. The experiments were conducted on six benchmark functions including two unimodal functions, three multimodal with many local minima, and one multimodal with a few local minima. The analysis of the results obtained was supported by statistical nonparametric Wilcoxon signed-rank tests. The algorithm employing self-adaptive selection revealed the best performance.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angeline, P.J.: Adaptive and self-adaptive evolutionary computations. In: Palaniswami, M., Attikiouzel, Y. (eds.) Computational Intelligence: A Dynamic Systems Perspective, pp. 152–163. IEEE Press, New York (1995)

    Google Scholar 

  2. Bäck, T.: Self-adaptation in genetic algorithms. In: Varela, F.J., Bourgine, P. (eds.) Proc. First European Conference on Arti-ficial Life, Toward a Practice of Autonomous Systems, pp. 263–271. MIT Press, Cambridge (1992)

    Google Scholar 

  3. Bäck, T., Schwefel, H.-P.: An Overview of Evolutionary Algorithms for Parameter Optimization. Evolutionary Computation 1(1), 1–23 (1993)

    Article  Google Scholar 

  4. Cervantes, J., Stephens, C.S.: Limitations of Existing Mutation Rate Heuristics and How a Rank GA Overcomes Them. IEEE Trans. Evolutionary Computation 13(2) (2009)

    Google Scholar 

  5. Deb, K., Beyer, H.-G.: Self-adaptive genetic algorithms with simulated binary crossover. Evolutionary Computation 9(2), 197–221 (2001)

    Article  Google Scholar 

  6. Digalakis, J.G., Margaritis, K.G.: An Experimental Study of Benchmarking Functions for Genetic Algorithms. Int. J. Computer Math. 79(4), 403–416 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Eiben, E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3(2), 124–141 (1999)

    Article  Google Scholar 

  8. Herrera, F., Lozano, M.: Fuzzy adaptive genetic algorithms: design, taxonomy, and future directions. Soft Computing 7(8), 545–562 (2003)

    Article  Google Scholar 

  9. Hinterding, R., Michalewicz, Z., Eiben, A.E.: Adaptation in Evolutionary Computation: A Survey. In: Proceedings of the Fourth International Conference on Evolutionary Computation (ICEC 1997), pp. 65–69. IEEE Press, New York (1997)

    Chapter  Google Scholar 

  10. Król, D., Lasota, T., Trawiński, B., Trawiński, K.: Investigation of evolutionary optimization methods of TSK fuzzy model for real estate appraisal. International Journal of Hybrid Intelligent Systems 5(3), 111–128 (2008)

    Article  MATH  Google Scholar 

  11. Maruo, M.H., Lopes, H.S., Delgado, M.R.: Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol. 3448, pp. 154–165. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Meyer-Nieberg, S., Beyer, H.-G.: Self-Adaptation in Evolutionary Algorithms. In: Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.) SCI, vol. 54, pp. 47–75. Springer, Heidelberg (2007)

    Google Scholar 

  13. Smith, J.E., Fogarty, T.C.: Operator and parameter adaptation in genetic algorithms. Soft Computing 1(2), 81–87 (1997)

    Article  Google Scholar 

  14. Tang, K., Li, X., Suganthan, P.N., Yang, Z., Weise, T.: Benchmark Functions for the CEC 2010 Special Session and Competition on Large Scale Global Optimization, Technical Report, Nature Inspired Computation and Applications Laboratory, USTC, China (2009), http://nical.ustc.edu.cn/cec10ss.php

  15. Yao, X., Liu, Y.: Fast evolution strategies. Contr. Cybern 26(3), 467–496 (1997)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smętek, M., Trawiński, B. (2011). Investigation of Genetic Algorithms with Self-Adaptive Crossover, Mutation, and Selection. In: Corchado, E., Kurzyński, M., Woźniak, M. (eds) Hybrid Artificial Intelligent Systems. HAIS 2011. Lecture Notes in Computer Science(), vol 6678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21219-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21219-2_16

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics