Editing Metaheuristic (section)

=== Hybridization and memetic algorithms ===
A hybrid metaheuristic is one that combines a metaheuristic with other optimization approaches, such as algorithms from [[mathematical programming]], [[constraint programming]], and [[machine learning]]. Both components of a hybrid metaheuristic may run concurrently and exchange information to guide the search.

On the other hand, [[Memetic algorithm]]s<ref name="moscato89evolution" /> represent the synergy of evolutionary or any population-based approach with separate individual learning or local improvement procedures for problem search. An example of memetic algorithm is the use of a local search algorithm instead of or in addition to a basic [[Mutation (genetic algorithm)|mutation operator]] in evolutionary algorithms.