Reducing bias and inefficiency in the selection algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Proceedings of the third international conference on Genetic algorithms
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Tabu Search
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
Bi-objective multipopulation genetic algorithm for multimodal function optimization
IEEE Transactions on Evolutionary Computation
A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous processor networks
Journal of Parallel and Distributed Computing
Collaboration and Competition Process: A Multi-Teams and Genetic Algorithm Hybrid Approach
International Journal of Artificial Life Research
Structural and Multidisciplinary Optimization
| Hi-index | 0.00 |
This paper considers a new method that enables a genetic algorithm (GA) to identify and maintain multiple optima of a multimodal function, by creating subpopulations within the niches defined by the multiple optima, thus warranting a good 'diversity'. The algorithm is based on a splitting of the traditional GA into a sequence of two processes. Since the GA behavior is determined by the exploration/exploitation balance, during the first step (Exploration), the multipopulation GA coupled with a speciation method detects the potential niches by classifying 'similar' individuals in the same population. Once the niches are detected, the algorithm achieves an intensification (Exploitation), by allocating a separate portion of the search space to each population. These two steps are alternately performed at a given frequency. Empirical results obtained with F6 Schaffer's function are then presented to show the reliability of the algorithm.