Skip to main content
SpringerLink
Log in

A Synergistic Selection Strategy in the Genetic Algorithms

  • Conference paper
Simulated Evolution and Learning (SEAL 2006)

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

Included in the following conference series:

  • 1432 Accesses

Abstract

According to the Neo-Darwinist, natural selection can be classified into three categories: directional selection, disruptive selection, and stabilizing selection. Traditional genetic algorithms can be viewed as a process of evolution based on directional selection that gives more chances of reproduction to superior individuals. However, this strategy sometimes is myopic and is apt to trap the search into a local optimal. Should we restrict genetic algorithms to direction selection? No! First, we show that stabilizing selection and disruptive selection are complementary and that hybridize them may supersede directional selection. Then, we adopt an island model of parallel genetic algorithms on which two types of selection strategies are applied to two subpopulations that both evolve independently and migration is allowed between them periodically. Experimental results show that the cooperation of disruptive selection and stabilizing selection is an effective and robust way in the genetic algorithms.

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

Access this chapter

Log in via an institution
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. Cohoon, J.P., Hedge, S.U., Martin, W.N., Richards, D.: Punctuated equilibria: A parallel Genetic Algorithms. In: Proceedings of the 2nd International Conference on Genetic algorithms, pp. 148–154 (1987)

    Google Scholar 

  2. Deb, K., Goldberg, D.E.: Sufficient conditions for deceptive and easy binary functions. Annals of Mathematics and Artificial Intelligence 10, 385–408 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Goldberg, D.E., Deb, K.: A Comparative Analysis of Selection Schemes Used in Genetic Algorithms. In: Proceedings of the 1st Foundations of Genetic Algorithms, pp. 69–93 (1991)

    Google Scholar 

  4. Grefenstette, J.J., Baker, J.E.: How Genetic Algorithms Work: a Critical Look at Implicit Parallelism. In: Proceedings of the 3rd International Conference on Genetic algorithms, pp. 20–27 (1989)

    Google Scholar 

  5. Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  6. Jones, T.C., Forrest, S.: Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. In: Proceedings of the 6th International Conference on Genetic algorithms, pp. 184–192 (1995)

    Google Scholar 

  7. Kuo, T., Hwang, S.Y.: A Genetic Algorithm with Disruptive Selection. IEEE Trans. on System, Man, and Cybernetics 26(2), 299–307 (1996)

    Article  Google Scholar 

  8. Kuo, T., Hwang, S.Y.: Why DGAs Work Well on GA-hard Functions? New Generation Computing 14, 459–479 (1996)

    Article  Google Scholar 

  9. Kuo, T., Hwang, S.Y.: Using Disruptive Selection to Maintain Diversity in Genetic Algorithms. Applied Intelligence 7(3), 257–267 (1997)

    Article  Google Scholar 

  10. Manderick, B., Spiessens, P.: Fine-grained Parallel Genetic Algorithms. In: Proceedings of the 3rd International Conference on Genetic algorithms, pp. 428–433 (1989)

    Google Scholar 

  11. Manly, B.F.J.: The Statistics of Natural Selection on Animal Populations. Chapman and Hall, London (1984)

    Google Scholar 

  12. Petty, C.B., Leuze, M.R., Grefenstette, J.J.: A Parallel Genetic Algorithm. In: Proceedings of the 2nd International Conference on Genetic algorithms, pp. 155–161 (1987)

    Google Scholar 

  13. Tanese, R.: Distributed Genetic Algorithms. In: Proceedings of the 3rd International Conference on Genetic algorithms, pp. 434–439 (1987)

    Google Scholar 

  14. Whitley, L.D., Kauth, J.: GENITOR: a Different Genetic Algorithm. In: Proceedings of the Rocky Mountain Conference on Artificial Intelligence, Denver, CO, pp. 118–130 (1988)

    Google Scholar 

  15. Wolpert, D.H., William, G.: Macready: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Takming College, No. 56, Sec. 1, Huanshan Rd., Neihu District, Taipei, Taiwan, R.O.C.

    Ting Kuo

Authors
  1. Ting Kuo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering and Management, Cheng Shiu University, Kaohsiung County Taiwan, ROC

    Tzai-Der Wang

  2. School of Computer Science and information Technology, RMIT University, VIC 3001, Melbourne, Australia

    Xiaodong Li

  3. AI-ECON Research Center, Department of Economics, National Chengchi University, 11623, Taipei, Taiwan

    Shu-Heng Chen

  4. Department of Computer Science and Technology, University of Sci. & Tech. of China, 230026, Hefei, Anhui, P.R. China

    Xufa Wang

  5. School of Information Technology and Electrical Engineering, University of New South Wales, Australian Defence Force Academy, Canberra, Australia

    Hussein Abbass

  6. The Univertity of Tokyo, Japan

    Hitoshi Iba

  7. Department of Computer, University of Science and Technology of China, 230027, Hefei, China

    Guo-Liang Chen

  8. University of Birmingham, Birmingham, UK

    Xin Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuo, T. (2006). A Synergistic Selection Strategy in the Genetic Algorithms. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_53

Download citation

  • DOI: https://doi.org/10.1007/11903697_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47331-2

  • Online ISBN: 978-3-540-47332-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation