ScholarGate
Ассистент

Сравнение методов

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Алгоритм светлячков×Генетический алгоритм×Harmony Search×
ОбластьОптимизацияОптимизацияОптимизация
СемействоProcess / pipelineProcess / pipelineProcess / pipeline
Год появления200819752001
Автор методаXin-She YangJohn Henry HollandZong Woo Geem, Joong Hoon Kim, G. V. Loganathan
ТипSwarm intelligence metaheuristicPopulation-based metaheuristicMetaheuristic 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 OptimizasyonHS algorithm, Harmoni Araması (Harmony Search), music-inspired optimization
Связанные555
Сводка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Набор данных
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Firefly Algorithm · Genetic Algorithm · Harmony Search. Получено 2026-06-17 из https://scholargate.app/ru/compare