Confronta i metodi
Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.
| Harmony Search× | Algoritmo Genetico× | |
|---|---|---|
| Campo | Ottimizzazione | Ottimizzazione |
| Famiglia | Process / pipeline | Process / pipeline |
| Anno di origine≠ | 2001 | 1975 |
| Ideatore≠ | Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan | John Henry Holland |
| Tipo≠ | Metaheuristic population-based optimization | Population-based metaheuristic |
| Fonte seminale≠ | 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 ↗ |
| Alias | HS algorithm, Harmoni Araması (Harmony Search), music-inspired optimization | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| Correlati | 5 | 5 |
| Sintesi≠ | 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. |
| ScholarGateInsieme di dati ↗ |
|
|