Fireworks algorithm: Difference between revisions
Reference and link swarm intelligence for context and to clarify "approach" |
Added a new algorithm description section, a brief elaboration on the summary, and a reference to the paper. |
||
| Line 1: | Line 1: | ||
The '''Fireworks Algorithm (FWA)''' is a [[swarm intelligence]] algorithm that explores a very large solution space by choosing a set of random points confined by some distance metric in the hopes that one or more of them will yield promising results, allowing for a more concentrated search nearby. |
The '''Fireworks Algorithm (FWA)''' is a [[swarm intelligence]] algorithm that explores a very large solution space by choosing a set of random points confined by some distance metric in the hopes that one or more of them will yield promising results, allowing for a more concentrated search nearby. |
||
== Algorithm Description == |
|||
The algorithm is implemented and described in terms of the explosion process of fireworks: explosions occur at specific points, and "sparks" fan out from the explosion. Each spark location is considered until an adequately optimal point is found. In terms of optimization, when finding an <math>x_j</math> satisfying <math>f(x_j)=y</math>, the algorithm continues until a spark is sufficiently near <math>x_j</math>.<ref>{{Citation | last1 = Tan | first1 = T | last2 = Zhu | first2 = Y | display-authors = 2 | title = Fireworks algorithm for optimization | year = 2010 | publisher = International Conference in Swarm Intelligence }}</ref> |
|||
==External links== |
==External links== |
||
Revision as of 21:20, 8 February 2020
The Fireworks Algorithm (FWA) is a swarm intelligence algorithm that explores a very large solution space by choosing a set of random points confined by some distance metric in the hopes that one or more of them will yield promising results, allowing for a more concentrated search nearby.
Algorithm Description
The algorithm is implemented and described in terms of the explosion process of fireworks: explosions occur at specific points, and "sparks" fan out from the explosion. Each spark location is considered until an adequately optimal point is found. In terms of optimization, when finding an satisfying , the algorithm continues until a spark is sufficiently near .[1]
External links
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |