Comparer des méthodes

	Harmony Search	Algorithme génétique
Domaine	Optimisation	Optimisation
Famille	Process / pipeline	Process / pipeline
Année d'origine	2001	1975
Auteur d'origine	Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan	John Henry Holland
Type	Metaheuristic population-based optimization	Population-based metaheuristic
Source fondatrice	Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2), 60–68.	Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.
Alias	HS algorithm, Harmoni Araması (Harmony Search), music-inspired optimization	GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon
Apparentées	5	5
Résumé	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.	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.