Fireworks Algorithm by Ying Tan

Author:Ying Tan
Language: eng
Format: epub
Publisher: Springer Berlin Heidelberg, Berlin, Heidelberg

where represents the position of firework i. That is, represents the worst firework, yielding the largest f value. Now define , the set of all points with f values smaller than that of the worst firework . It is assumed that all the fireworks lie in the same ‘basin’ of the function.

In the next section this will be extended to the general case with multiple basins.

From Algorithm 9.2, function D introduced in assumption H1 is defined for the CoFWA as

where , are the sparks that the firework generates in the kth iteration. The definition of D above clearly complies with (H1), since the is monotonic by definition.

Then we go back to the generation of the sparks of the best firework.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.