Genetic Algorithm of Tournament Crowding Based on Gaussian Mutation
| Autor: | V. P. Shylo, K. V. Nikishchikhina, Mykola Glybovets, Nataliya M. Gulayeva |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
education.field_of_study
021103 operations research Optimization problem General Computer Science Computer science Computation 010102 general mathematics Population 0211 other engineering and technologies 02 engineering and technology 01 natural sciences Crowding Maxima and minima Distribution (mathematics) Genetic algorithm Tournament 0101 mathematics education Algorithm |
| Zdroj: | Cybernetics and Systems Analysis. 56:231-242 |
| ISSN: | 1573-8337 1060-0396 |
| DOI: | 10.1007/s10559-020-00239-4 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink