Genetic algorithms with sharing for multimodal function optimization
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
An investigation of niche and species formation in genetic function optimization
Proceedings of the third international conference on Genetic algorithms
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Design optimization with advanced genetic search strategies
Advances in Engineering Software
Improving Genetic Algorithms with Sharing through Cluster Analysis
Proceedings of the 5th International Conference on Genetic Algorithms
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
Dynamics of fitness sharing evolutionary algorithms for coevolution of multiple species
Applied Soft Computing
Ensemble of niching algorithms
Information Sciences: an International Journal
Analysis of new niching genetic algorithms for finding multiple solutions in the job shop scheduling
Journal of Intelligent Manufacturing
Collaboration and Competition Process: A Multi-Teams and Genetic Algorithm Hybrid Approach
International Journal of Artificial Life Research
Hi-index | 0.00 |
Genetic algorithms with sharing have been applied in many multimodal optimization problems with success. Traditional sharing schemes require the definition of a common sharing radius, but the predefined radius cannot fit most problems where design niches are of different sizes. Yin and Germay proposed a sharing scheme with cluster analysis methods, which can determine design clusters of different sizes. Since clusters are not necessarily coincident with niches, sharing with clustering techniques fails to provide maximum sharing effects. In this paper, a sharing scheme based on niche identification techniques (NIT) is proposed, which is capable of determining the center location and radius of each of existing niches based on fitness topographical information of designs in the population. Genetic algorithms with NIT were tested and compared to GAs with traditional sharing scheme and sharing with cluster analysis methods in four illustrative problems. Results of numerical experiments showed that the sharing scheme with NIT improved both search stability and effectiveness of locating multiple optima. The niche-based genetic algorithm and the multiple local search approach are compared in the fifth illustrative problem involving a discrete ten-variable bump function problem.