方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 差分进化× | 萤火虫算法× | |
|---|---|---|
| 领域 | 优化 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1997 | 2008 |
| 提出者≠ | Rainer Storn & Kenneth Price | Xin-She Yang |
| 类型≠ | Population-based stochastic metaheuristic | Swarm intelligence metaheuristic |
| 开创性文献≠ | Storn, R. & Price, K. (1997). Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. Journal of Global Optimization, 11(4), 341–359. DOI ↗ | Yang, X.S. (2010). Firefly Algorithm, Stochastic Test Functions and Design Optimisation. International Journal of Bio-Inspired Computation, 2(2), 78-84. DOI ↗ |
| 别名 | DE algorithm, Diferansiyel Evrim (DE), DE optimization | FA, Firefly Optimization, Ateşböceği Algoritması (Firefly Algorithm) |
| 相关 | 5 | 5 |
| 摘要≠ | Differential Evolution (DE), introduced by Rainer Storn and Kenneth Price in 1997, is a population-based stochastic optimisation algorithm designed for continuous parameter spaces. It generates candidate solutions by combining vector differences between existing population members, making it a powerful and parameter-lean alternative to Genetic Algorithms and Particle Swarm Optimisation when the search landscape is non-convex, multimodal, or poorly suited to gradient-based methods. | 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. |
| ScholarGate数据集 ↗ |
|
|