A Novel Memetic Algorithm with Imperialist Competition as Local Search
Shirin Nozarian, Majid Vafaei Jahan · 2012
A special position has been allocated to combinatory strategy among several solutions which are offered to solve the meta-heuristic problems. This strategy is obtained by applying different techniques in the process of problem solving. Memetic algorithms are the most famous member of this family, which are made by combining the genetic algorithms with heuristic local searches. Imperialistic competitive algorithm is used in this research as local search and its efficiency level is evaluated in solving the knapsack 1-0 problem. Obtained results revealed more efficiency of this method comparing with usual genetic algorithm; also the simulations show that it does not have any better glowing results in comparison to imperialistic competitive algorithm.