Process / pipeline
Harmony Search — 音乐启发式元启发式优化
Harmony Search (HS) 是一种群体元启发式优化算法，由 Geem、Kim 和 Loganathan 于 2001 年提出。它模仿爵士乐手寻求完美和谐状态的即兴创作过程，使用三个算子——记忆考虑、音高调整和随机选择——来生成候选解。该算法适用于连续和离散变量，并在工程设计、供水网络优化和组合问题中得到广泛应用。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2), 60–68. DOI: 10.1177/003754970107600201 ↗
- Mahdavi, M., Fesanghary, M., & Damangir, E. (2007). An Improved Harmony Search Algorithm for Solving Optimization Problems. Applied Mathematics and Computation, 188(2), 1567–1579. DOI: 10.1016/j.amc.2006.11.033 ↗
如何引用本页
ScholarGate. (2026, June 1). Harmony Search Algorithm. ScholarGate. https://scholargate.app/zh/optimization/harmony-search
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →