Memetic algorithm with strategic controller for the maximum clique problem
Kengo Katayama, Akinori Kohmura, Keiko Kohmoto, Hideo Minamihara · 2011
Most of standard evolutionary algorithms consist of a mutation, a crossover, a selection and often a local search. Each of these operators is specifically designed for a combinatorial optimization problem. These can be considered as tools for the optimization searches, and the interplay between them in the searches is not apparently controlled in many cases.