Skip to main content

Advertisement

Log in

Genetic Algorithm of Tournament Crowding Based on Gaussian Mutation

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

To solve multimodal optimization problems, a new niching genetic algorithm named tournament crowding genetic algorithm based on Gaussian mutation is proposed. A comparative analysis of this algorithm to other crowding algorithms and to parallel hill-climbing algorithm has shown the advantages of the proposed algorithm in many cases. The FPR criterion to estimate the distribution of population elements is proposed and it is shown that computation of this criterion is advisable to estimate algorithms solving multimodal problems of finding global and local maxima.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. M. Glybovets and N. M. Gulayeva, “Evolutionary multimodal optimization,” in: S. Butenko, P. M. Pardalos, and V. Shylo (eds.), Optimization Methods and Applications: In Honor of Ivan V. Sergienko’s 80th Birthday, Springer International Publishing (2017), pp. 129–173.

  2. M. Preuss, Multimodal Optimization by Means of Evolutionary Algorithms, Springer, Berlin (2015).

    Book  Google Scholar 

  3. C. R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, Halsted Press, New York (1993).

    MATH  Google Scholar 

  4. U. Aickelin, “An indirect genetic algorithm for set covering problems,” J. of the Oper. Res. Society, Vol. 53, Iss. 10, 1118–1126 (2002).

  5. I. V. Sergienko, and V. P. Shylo, Discrete Optimization Problems: Challenges, Solution Techniques, and Analysis [in Russian], Naukova Dumka, Kyiv (2003).

    Google Scholar 

  6. M. M. Glybovets and N. M. Gulayeva, Evolutionary Algorithms [in Ukrainian], Kyiv Mohyla Academy, Kyiv (2013).

    Google Scholar 

  7. S. Mahfoud, “Niching method for genetic algorithms,” Ph.D. Thesis, Univ. of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Lab. (1995).

  8. G. Singh and K. Deb, “Comparison of multi-modal optimization algorithms based on evolutionary algorithms,” in: Proc. 8th Ann. Conf. on Genetic and Evolutionary Computation (GECCO’06) (Seattle, Washington, USA, July 8–12, 2006), Seattle (2006), pp. 1305–1312.

  9. T. Friedrich, P. S. Oliveto, D. Sudholt, and C. Witt, “Analysis of diversity-preserving nechanisms for global exploration,” Evolutionary Computation, Vol. 17, No. 4, 455–476 (2009). https://doi.org/10.1162/evco.2009.17.4.17401.

    Article  Google Scholar 

  10. E. C. Osuna and D. Sudholt, “Runtime analysis of crowding mechanisms for multimodal optimization,” IEEE Trans. Evol. Comp. (2019). https://doi.org/10.1109/TEVC.2019.2914606.

    Book  Google Scholar 

  11. O. Mengshoel and D. Goldberg, “Probabilistic crowding: deterministic crowding with probabilistic replacement,” in: W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith (eds.), Proc. Genetic and Evolutionary Computation Conference (GECCO-99) (Orlando, FL, USA, July 13–17, 1999), Orlando (1999), pp. 409–416.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. P. Shylo.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 2, March–April, 2020, pp. 75–88.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shylo, V.P., Glybovets, M.M., Gulayeva, N.M. et al. Genetic Algorithm of Tournament Crowding Based on Gaussian Mutation. Cybern Syst Anal 56, 231–242 (2020). https://doi.org/10.1007/s10559-020-00239-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-020-00239-4

Keywords

Navigation