方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Harmony Search× | 遗传算法× | |
|---|---|---|
| 领域 | 优化 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 2001 | 1975 |
| 提出者≠ | Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan | John Henry Holland |
| 类型≠ | Metaheuristic population-based optimization | Population-based metaheuristic |
| 开创性文献≠ | Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2), 60–68. DOI ↗ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| 别名 | HS algorithm, Harmoni Araması (Harmony Search), music-inspired optimization | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| 相关 | 5 | 5 |
| 摘要≠ | 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. |
| ScholarGate数据集 ↗ |
|
|