Skip to main content

A Genetic Algorithm with Elite Crossover and Dynastic Change Strategies

  • Conference paper
Advances in Natural Computation (ICNC 2005)

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

Included in the following conference series:

Abstract

This paper proposes an elite crossover strategy together with a dynastic change strategy for genetic algorithms. These strategies are applied to the elites, with a different crossover operation applied to the general population. This multi-crossover operation approach is different from the traditional genetic algorithms where the same crossover strategy is used on both elites and general population. The advantage of adopting a multi-crossover operation approach is faster convergence. Additionally, by adopting a dynastic change strategy in the elite crossover operation, the problem of premature convergence does not need to be actively corrected. The inspiration for the dynastic change strategy comes from ancient Chinese history where royal members of a dynasty undertake intermarriages with other royal members in order to enhance their ascendancy. The central thesis of our elite crossover strategy is that a dynasty can never be sustained forever in a society that changes continuously with its environment. A set of 8 benchmark functions is selected to investigate the effectiveness and efficiency of the proposed genetic algorithm.

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 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Holland, J.H.: Adapation in Neural and Artificial Systems. Univ. of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  2. De Jong, K.A.: An Analysis of the Behavior of Class of Genetic Adaptive Systems. Ph.D. Dissertation, Univ. of Michigan (1975)

    Google Scholar 

  3. Baker, J.E.: Reducing Bias and Inefficiency in the Selection Algorithm. In: Proc. 2nd Ann. Conf. Genetic Algorithms. MIT, Cambridge (1985)

    Google Scholar 

  4. Goldberg, D.E., Richardson, J.: Genetic Algorithms with Sharing for Multimodal Function Optimization. In: Proc. 2nd Int. Conf. Genetic Algorithms, Hillsdale, NJ (1987)

    Google Scholar 

  5. Tanese, R.: Distributed Genetic Algorithms. In: Proc. 3rd Int. Conf. Genetic Algorithms. Morgan Kaufman, Los Altos (1989)

    Google Scholar 

  6. Lis, J.: Genetic Algorithm with the Dynamic Probability of Mutation in the Classification Problem. Pattern Recognition Letters 16, 1311–1320 (1995)

    Article  Google Scholar 

  7. Michalewiczs, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)

    Google Scholar 

  8. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  9. Fogel, D.B., Fogel, G.B., Ohkura, K.: Multiple-vector Self-adaptation in Evolutionary Algorithms. BioSystems 61, 155–162 (2001)

    Article  Google Scholar 

  10. Salomon, R.: Re-evaluating Genetic Algorithm Performance Under Coordinate Rotation of Benchmark Functions: A Survey of Some Theoretical and Practical Aspects of Genetic Algorithms. BioSystems 39, 263–278 (1996)

    Article  Google Scholar 

  11. Mingqiang, L., Jisong, K., Dan, L., Quanshu, L.: Fundamentals and Applications of Genetic Algorithms. Science Press, Beijing (2002)

    Google Scholar 

  12. Bohachevsky, I.O., Johnson, M.E., Stein, M.L.: Generalized Simulated Annealing for Function Optimization. Technometrics 28, 209–218 (1986)

    Article  MATH  Google Scholar 

  13. Fogel, D.B.: Evolutionary computation: Toward a New Philosophy of Machine Intelligence, p. 152. IEEE Press, New York (2000)

    Google Scholar 

  14. Ackley, D.H.: A Connectionist Machine for Genetic Hill Climbing. Kluwer, Boston (1987)

    Google Scholar 

  15. Saravanan, N., Fogel, D.B., Nelson, K.M.: A Comparison of Methods for Self-Adaptation in Evolutionary Algorithms. BioSystems 36, 157–166 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, Y., Han, R.P.S. (2005). A Genetic Algorithm with Elite Crossover and Dynastic Change Strategies. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_32

Download citation

  • DOI: https://doi.org/10.1007/11539902_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics