विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| फायरफ्लाई एल्गोरिथम× | जेनेटिक एल्गोरिथम× | हार्मनी सर्च× | |
|---|---|---|---|
| क्षेत्र | अनुकूलन | अनुकूलन | अनुकूलन |
| परिवार | Process / pipeline | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 2008 | 1975 | 2001 |
| प्रवर्तक≠ | Xin-She Yang | John Henry Holland | Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan |
| प्रकार≠ | Swarm intelligence metaheuristic | Population-based metaheuristic | Metaheuristic population-based optimization |
| मौलिक स्रोत≠ | Yang, X.S. (2010). Firefly Algorithm, Stochastic Test Functions and Design Optimisation. International Journal of Bio-Inspired Computation, 2(2), 78-84. DOI ↗ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ | Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2), 60–68. DOI ↗ |
| उपनाम | FA, Firefly Optimization, Ateşböceği Algoritması (Firefly Algorithm) | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon | HS algorithm, Harmoni Araması (Harmony Search), music-inspired optimization |
| संबंधित | 5 | 5 | 5 |
| सारांश≠ | The Firefly Algorithm (FA), introduced by Xin-She Yang in 2008 and formally published in 2010, is a nature-inspired swarm metaheuristic that models the bioluminescent attraction behaviour of fireflies. Each candidate solution is a firefly whose brightness represents its objective-function value; dimmer fireflies move toward brighter ones with an attraction force that decays with distance, driving the swarm toward optima without gradient information. | 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. | 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. |
| ScholarGateडेटासेट ↗ |
|
|
|