期刊名称：International Journal of Soft Computing & Engineering
电子版ISSN：2231-2307
出版年度：2013
卷号：3
期号：2
页码：140-145
出版社：International Journal of Soft Computing & Engineering
摘要：Genetic Algorithms are the population based search and optimization technique that mimic the process of natural evolution. Premature Convergence and genetic drift are the inherent characteristics of genetic algorithms that make them incapable of finding global optimal solution. A memetic algorithm is an extension of genetic algorithm that incorporates the local search techniques within genetic operations so as to prevent the premature convergence and improve performance in case of NP-hard problems. This paper proposes a new memetic algorithm where hill climbing local search is applied to each individual selected after selection operation. The experiments have been conducted using four different benchmark functions and implementation is carried out using MATLAB. The function’s result shows that the proposed memetic algorithm performs better than the genetic algorithm in terms of producing more optimal results and maintains balance between exploitation and exploration within the search space.
关键词：benchmark;functions;hybrid;genetic;algorithms; hill climbing; memetic algorithms.
