Porovnať metódy

	Harmony Search	Optimalizácia rojom častíc (PSO)
Odbor	Optimalizácia	Optimalizácia
Rodina	Process / pipeline	Process / pipeline
Rok vzniku	2001	1995
Tvorca	Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan	—
Typ	Metaheuristic population-based optimization	Population-based metaheuristic / swarm intelligence
Pôvodný zdroj	Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2), 60–68.	Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948.
Ďalšie názvy	HS algorithm, Harmoni Araması (Harmony Search), music-inspired optimization	PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Príbuzné	5	6
Zhrnutie	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.	Particle Swarm Optimization (PSO) is a population-based metaheuristic algorithm introduced by Kennedy and Eberhart in 1995, inspired by the collective movement of bird flocks and fish schools. Each candidate solution — called a particle — moves through the search space by updating its velocity and position based on its own best experience and the best experience of the entire swarm, enabling fast convergence across continuous optimization problems.