Genetic algorithms with sharing for multimodal function optimization
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
A sequential niche technique for multimodal function optimization
Evolutionary Computation
Fitness sharing and niching methods revisited
IEEE Transactions on Evolutionary Computation
Parameter optimization for growth model of greenhouse crop using genetic algorithms
Applied Soft Computing
Dynamics of fitness sharing evolutionary algorithms for coevolution of multiple species
Applied Soft Computing
Predication based immune network for multimodal function optimization
Engineering Applications of Artificial Intelligence
A clustering-based differential evolution for global optimization
Applied Soft Computing
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem
Expert Systems with Applications: An International Journal
Effect of spatial locality on an evolutionary algorithm for multimodal optimization
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
A memetic particle swarm optimization algorithm for multimodal optimization problems
Information Sciences: an International Journal
Evolutionary multimodal optimization using the principle of locality
Information Sciences: an International Journal
MLDM'13 Proceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition
Hi-index | 0.00 |
Interest in multimodal function optimization is expanding rapidly since real-world optimization problems often require location of multiple optima in a search space. In this paper, we propose a novel genetic algorithm which combines crowding and clustering for multimodal function optimization, and analyze convergence properties of the algorithm. The crowding clustering genetic algorithm employs standard crowding strategy to form multiple niches and clustering operation to eliminate genetic drift. Numerical experiments on standard test functions indicate that crowding clustering genetic algorithm is superior to both standard crowding and deterministic crowding in quantity, quality and precision of multi-optimum search. The proposed algorithm is applied to the practical optimal design of varied-line-spacing holographic grating and achieves satisfactory results.