Journal
INFORMATION SCIENCES
Volume 180, Issue 15, Pages 2815-2833Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2010.04.008
Keywords
Ensemble; Genetic algorithm; Multimodal optimization; Niching; Restricted tournament selection; Clearing; Dynamic fitness sharing; Restricted competition selection; Pattern search; Species conserving genetic algorithm; Spatially-structured evolutionary algorithm; Real-coded sequential niching memetic; algorithm
Categories
Funding
- A*Star (Agency for Science, Technology and Research) [052 101 0020]
Ask authors/readers for more resources
Although niching algorithms have been investigated for almost four decades as effective procedures to obtain several good and diverse solutions of an optimization problem, no effort has been reported on combining different niching algorithms to form an effective ensemble of niching algorithms. In this paper, we propose an ensemble of niching algorithms (ENA) and illustrate the concept by an instantiation which is realized using four different parallel populations. The offspring of each population is considered by all parallel populations. The instantiation is tested on a set of 16 real and binary problems and compared against the single niching methods with respect to searching ability and computation time. Results confirm that ENA method is as good as or better than the best single method in it on every test problem. Moreover, comparison with other state-of-the-art niching algorithms demonstrates the competitiveness of our proposed ENA. (C) 2010 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available