Сравнение методов

	Harmony Search	Tabu Search
Область	Оптимизация	Оптимизация
Семейство	Process / pipeline	Process / pipeline
Год появления	2001	1989
Автор метода	Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan	Fred Glover
Тип	Metaheuristic population-based optimization	Local-search metaheuristic
Основополагающий источник	Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2), 60–68.	Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206.
Другие названия	HS algorithm, Harmoni Araması (Harmony Search), music-inspired optimization	Tabu Araması (Tabu Search), TS, tabu metaheuristic
Связанные	5	4
Сводка	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.	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.