Skip to main content

A Novel Clustering Fitness Sharing Genetic Algorithm

  • Conference paper
Advances in Natural Computation (ICNC 2005)

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

Included in the following conference series:

Abstract

The hybrid multimodal optimization algorithm that combines a novel clustering method and fitness sharing method is presented in this paper. The only parameter required by the novel clustering method is the peak number. The clustering criteria include minimizing the square sum of the inner-group distance, maximizing the square sum of the inter-group distance, and the fitness value of the individuals. After each individual has been classified to the certain cluster, fitness sharing genetic algorithm is used to find multiple peaks simultaneously. The empirical study of the benchmark problems shows that the proposed method has satisfactory performance.

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.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

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

    MATH  Google Scholar 

  3. Mahfoud, S.W.: Genetic Drift in Sharing Methods. In: Proceedings of the First IEEE Conference on Evolutionary Computation, pp. 67–72. IEEE Press, Piscataway (1994)

    Chapter  Google Scholar 

  4. Goldberg, D.E., Richardson, J.: Genetic Algorithms with Sharing for Multimodal Function Optimization. In: Grefenstette, J.J. (ed.) Proceedings of the Second International Conference on Genetic Algorithms and Their Applications, pp. 41–49. Lawrence Erlbaum, Hillsdale (1987)

    Google Scholar 

  5. Petrowski, A.: A Clearing Procedure as a Niching Method for Genetic Algorithms. In: Proceedings of the third IEEE Conference on Evolutionary Computation, pp. 798–803. IEEE Press, Piscataway (1996)

    Chapter  Google Scholar 

  6. Miller, B.L., Shaw, M.J.: Genetic Algorithms with Dynamic Niche Sharing for Multimodal Function Optimization. In: Proceedings of the third IEEE Conference on Evolutionary Computation, pp. 786–791. IEEE Press, Piscataway (1996)

    Chapter  Google Scholar 

  7. Goldberg, D.E., Wang, L.: Adaptive Niching via Coevolutionary Sharing. IlliGAL Report No. 97007 (1997)

    Google Scholar 

  8. Yin, X., Germay, N.: A Fast Genetic Algorithm with Sharing Scheme Using Cluster Analysis Methods in Multimodal Function Optimization. In: Albrecht, R.F. (ed.) Proceedings of International Conference on Artificial Neural Nets and Genetic Algorithms, pp. 450–457. Springer, New York (1993)

    Google Scholar 

  9. Lin, C.Y., Liu, J.Y., Yang, Y.J.: Hybrid Multimodal Optimization with Clustering Genetic Strategies. Engineering Optimization 30, 263–280 (1998)

    Article  Google Scholar 

  10. Torn, A.: A Search-clustering Approach to Global Optimization. In: Dixon, S. (ed.) Towards Global Optimization, vol. 2, pp. 49–70. North-Holland, Amsterdam (1978)

    Google Scholar 

  11. Hanagandi, V., Nikolaou, M.: A Hybrid Approach to Global Optimization Using A Clustering Algorithm in a Genetic Search Framework. Computers Chem. Engng. 22(12), 1913–1925 (1998)

    Article  Google Scholar 

  12. Everitt, B.S.: Cluster Analysis, 3rd edn. John Wiley & Sons, New York (1993)

    Google Scholar 

  13. Deb, K., Goldberg, D.E.: An Investigation of Niche and Species Formation in Genetic Function Optimization. In: Schaffer, J.D. (ed.) Proceedings of the Third International Conference on Genetic Algorithms and their Applications, pp. 42–50. Morgan Kaufmann, San Mateo (1989)

    Google Scholar 

  14. Sareni, B., Krahenbuhl, L.: Fitness Sharing and Niching Methods Revisited. IEEE Transactions on Evolutionary Computation 2(3), 97–106 (1998)

    Article  Google Scholar 

  15. Harik, G.: Finding multimodal solutions using restricted tournament selection. In: Eshelman, L. (ed.) Proceedings of the 6th International Conference on Genetic Algorithms, pp. 24–31. Morgan Kaufmann, San Mateo (1995)

    Google Scholar 

  16. Goldberg, D.E., Deb, K., Horn, J.: Massive Multimodality, Deception, and Genetic Algorithms. In: Manner, R., Manderick, B. (eds.) Proceedings of the Second Conference on Parallel Problem Solving from Nature, pp. 15–25. North-Holland, Amsterdam (1992)

    Google Scholar 

  17. Baker, J.E.: Reducing Bias and Inefficiency in the Selection Algorithm. In: Grefenstette, J.J. (ed.) Proceedings Of the Second International Conference on Genetic Algorithms and Their Applications, pp. 14–21. Lawrence Erlbaum, Hillsdale (1987)

    Google Scholar 

  18. Yu, X., Wang, Z.: The Fitness Sharing Genetic Algorithms with Adaptive Power Law Scaling. System Engineering Theory and Practice 22(2), 42–48 (2002)

    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

Yu, X. (2005). A Novel Clustering Fitness Sharing Genetic Algorithm. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539117_146

Download citation

  • DOI: https://doi.org/10.1007/11539117_146

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28325-6

  • Online ISBN: 978-3-540-31858-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics