Confronta i metodi

	Cuckoo Search	Algoritmo Genetico	Harmony Search
Campo	Ottimizzazione	Ottimizzazione	Ottimizzazione
Famiglia	Process / pipeline	Process / pipeline	Process / pipeline
Anno di origine	2009	1975	2001
Ideatore	—	John Henry Holland	Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan
Tipo	Population-based metaheuristic / swarm intelligence	Population-based metaheuristic	Metaheuristic population-based optimization
Fonte seminale	Yang, X.S. & Deb, S. (2009). Cuckoo Search via Lévy Flights. 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 210-214. IEEE.	Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.	Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2), 60–68.
Alias	Guguk Kuşu Araması (Cuckoo Search), CS algorithm, Cuckoo Search via Lévy Flights	GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon	HS algorithm, Harmoni Araması (Harmony Search), music-inspired optimization
Correlati	6	5	5
Sintesi	Cuckoo Search (CS) is a population-based metaheuristic optimization algorithm introduced by Xin-She Yang and Suash Deb in 2009. It models the obligate brood-parasitism of cuckoo birds — which lay eggs in other birds' nests — combined with Lévy flight random walks that enable long-range exploration of the search space. The algorithm has proven effective in structural engineering design, machine learning hyperparameter tuning, and other continuous black-box optimization problems.	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.	Harmony Search (HS) is a population-based metaheuristic optimization algorithm introduced by Geem, Kim, and Loganathan in 2001. It mimics the improvisation process of jazz musicians seeking a perfect state of harmony, using three operators — memory consideration, pitch adjustment, and random selection — to generate candidate solutions. The algorithm applies to both continuous and discrete variables and has found wide use in engineering design, water distribution network optimization, and combinatorial problems.