Sammenlign metoder

	Harmony Search	Differential Evolution
Fagområde	Optimering	Optimering
Familie	Process / pipeline	Process / pipeline
Oprindelsesår	2001	1997
Ophavsperson	Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan	Rainer Storn & Kenneth Price
Type	Metaheuristic population-based optimization	Population-based stochastic metaheuristic
Oprindelig kilde	Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2), 60–68.	Storn, R. & Price, K. (1997). Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. Journal of Global Optimization, 11(4), 341–359.
Aliasser	HS algorithm, Harmoni Araması (Harmony Search), music-inspired optimization	DE algorithm, Diferansiyel Evrim (DE), DE optimization
Relaterede	5	5
Resumé	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.	Differential Evolution (DE), introduced by Rainer Storn and Kenneth Price in 1997, is a population-based stochastic optimisation algorithm designed for continuous parameter spaces. It generates candidate solutions by combining vector differences between existing population members, making it a powerful and parameter-lean alternative to Genetic Algorithms and Particle Swarm Optimisation when the search landscape is non-convex, multimodal, or poorly suited to gradient-based methods.