Porównaj metody

	Algorytm memetyczny	Algorytm genetyczny	Hiperheurystyki
Dziedzina	Optymalizacja	Optymalizacja	Optymalizacja
Rodzina	Process / pipeline	Process / pipeline	Process / pipeline
Rok powstania	1989	1975	2013
Twórca	Pablo Moscato	John Henry Holland	Burke et al.
Typ	Hybrid metaheuristic	Population-based metaheuristic	High-level search methodology
Źródło pierwotne	Moscato, P. (1989). On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech Concurrent Computation Program Report 826.	Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.	Burke, E. K., et al. (2013). Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12), 1695–1724.
Inne nazwy	Hybrid Evolutionary Algorithm, Cultural Algorithm (local-search variant), Genetic Local Search, Memetik Algoritma	GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon	Heuristic of Heuristics, Algorithm Selection Hyper-Heuristic, Selection Hyper-Heuristic, Hiyer-Sezgisel
Pokrewne	3	5	3
Podsumowanie	A Memetic Algorithm (MA) is a population-based metaheuristic that combines the global exploration of an evolutionary algorithm with the local exploitation of individual learning procedures. Introduced by Pablo Moscato in 1989 at Caltech, MAs draw on Richard Dawkins' concept of the meme — a unit of cultural transmission — to model the idea that solutions can improve not only through crossover and mutation but also through individual refinement within each generation.	A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail.	Hyper-heuristics are high-level methodologies that search over a space of heuristics rather than directly over the space of solutions. Introduced systematically by Burke et al. (2013) in their landmark survey, hyper-heuristics operate by selecting or generating low-level heuristics to solve hard combinatorial optimisation and search problems, aiming to automate the design of optimisation algorithms across diverse problem domains without requiring deep problem-specific knowledge.