مقایسهٔ روش‌ها

	الگوریتم میمتیک	الگوریتم ژنتیک	هایپر-هیوریستیک‌ها (Hyper-heuristics)	جستجوی ممنوعه
حوزه	بهینه‌سازی	بهینه‌سازی	بهینه‌سازی	بهینه‌سازی
خانواده	Process / pipeline	Process / pipeline	Process / pipeline	Process / pipeline
سال پیدایش	1989	1975	2013	1989
پدیدآور	Pablo Moscato	John Henry Holland	Burke et al.	Fred Glover
نوع	Hybrid metaheuristic	Population-based metaheuristic	High-level search methodology	Local-search metaheuristic
منبع بنیادین	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.	Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206.
نام‌های دیگر	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	Tabu Araması (Tabu Search), TS, tabu metaheuristic
مرتبط	3	5	3	4
خلاصه	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.	Tabu Search is a local-search metaheuristic introduced by Fred Glover in 1989 that uses a tabu list — a short-term memory of recently visited solutions — to prevent cycling and escape local optima. By explicitly forbidding moves that reverse recent decisions, the algorithm explores the search space more broadly and, through long-term memory structures such as aspiration criteria, aims to approach the global optimum even in large, complex combinatorial problems.