ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

Harmony Search×אלגוריתם גנטי×
תחוםאופטימיזציהאופטימיזציה
משפחהProcess / pipelineProcess / pipeline
שנת המקור20011975
הוגה השיטהZong Woo Geem, Joong Hoon Kim, G. V. LoganathanJohn Henry Holland
סוגMetaheuristic population-based optimizationPopulation-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 optimizationGA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon
קשורות55
תקציר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מערך נתונים
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 2 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Harmony Search · Genetic Algorithm. אוחזר בתאריך 2026-06-15 מתוך https://scholargate.app/he/compare