Skip to main content

Atavistic Strategy for Genetic Algorithm

  • Conference paper
Advances in Swarm Intelligence (ICSI 2011)

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

Included in the following conference series:

Abstract

Atavistic evolutionary strategy for genetic algorithm is put forward according to the atavistic phenomena existing in the process of biological evolution, and the framework of the new strategy is given also. The effectiveness analysis of the new strategy is discussed by three characteristics of the reproduction operators. The introduction of atavistic evolutionary strategy is highly compatible with the minimum induction pattern, and increases the population diversity to a certain extent. The experimental results show that the new strategy improves the performance of genetic algorithm on convergence time and solution quality.

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. Rudolph, G.: Convergence Properties of Canonical Genetic Algorithms. IEEE Transactions on Neural Networks 5, 96–101 (1994)

    Article  Google Scholar 

  2. Xu, Z.B., Gao, Y.: Analysis and prevention of the genetic algorithm premature characteristics. Science in China, Series E 26, 364 (1996)

    Google Scholar 

  3. Wang, M.L., Wang, X.G., Liu, G.: Quantitative analysis and prevention of genetic algorithm premature convergence. Systems Engineering and Electronics 28, 1249–1251 (2006)

    Google Scholar 

  4. Fu, X.H., Kang, L.: Study of the premature convergence of genetic algorithms. Journal of Huazhong University of Science and Technology (Nature Science) 31, 53–54 (2003)

    Google Scholar 

  5. Zhou, H.W., Yuan, J.H., Zhang, L.S.: Improved Politics of Genetic Algorithms for Premature. Computer Engineering 33, 201–203 (2007)

    Google Scholar 

  6. Zhang, L., Zhang, B.: Research on the Mechanism of Genetic Algorithms. Journal of Software 11, 945–952 (2000)

    Google Scholar 

  7. Sultan, B.M., Mahmud, R., Sulaiman, M.N.: Reducing Premature Convergence Problem through Numbers Structuring in Genetic Algorithm. International Journal of Computer Science and Network Security 7, 215–217 (2007)

    Google Scholar 

  8. Hrstka, A.L.: Improvements of real coded genetic algorithms based on differential operators preventing premature convergence. Advances in Engineering Software 35, 237–246 (2004)

    Article  Google Scholar 

  9. Fu, X.F.: An Algebraic Model for State Space of GA. Mathematics in Practice and Theory 35, 119–123 (2005)

    Google Scholar 

  10. Xu, Z.B., Zhang, J.S., Zheng, Y.L.: The bionics in computation intelligence: theory and algorithm. Science Press, Beijing (2003)

    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

Lin, D., Li, X., Wang, D. (2011). Atavistic Strategy for Genetic Algorithm. In: Tan, Y., Shi, Y., Chai, Y., Wang, G. (eds) Advances in Swarm Intelligence. ICSI 2011. Lecture Notes in Computer Science, vol 6728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21515-5_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21515-5_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21514-8

  • Online ISBN: 978-3-642-21515-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics