Jump to content

Fireworks algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ketiltrout (talk | contribs) at 21:06, 29 June 2016 (Ketiltrout moved page Fireworks Algorithm to Fireworks algorithm). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In general the Fireworks Algorithm (FWA) is an approach to exploring 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.