期刊名称：International Journal of Intelligence Science
印刷版ISSN：2163-0283
电子版ISSN：2163-0356
出版年度：2011
卷号：1
期号：1
页码：1-7
DOI：10.4236/ijis.2011.11001
出版社：Scientific Research Publishing
摘要：Optimization implies the minimization or maximization of an objective function. Some problems have sev-eral optimum points which all, should be computed. Niching method is presented to do so. However, its efficiency can be improved via combining it with Memetic algorithm. Therefore, in this paper, Memetic method is used to improve this method in terms of convergence rate and diversity. In the proposed methods, genetic algorithm, PSO, and learning automata are used as a local search algorithm of Memetic method. The result of simulations demonstrates that proposed methods are more effective compared with Niching in terms of convergence and diversity.
