Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6904259 | Applied Soft Computing | 2018 | 29 Pages |
Abstract
The fireworks algorithm is a newly proposed swarm algorithm for global optimization, which adopts a novel manner of search called explosion. In this paper, we introduce a simplified version of the fireworks algorithm, where only the essential explosion operation is kept, called the bare bones fireworks algorithm. The bare bones fireworks algorithm is simple, fast and easy to implement. Sufficient conditions for local convergence are given. Experimental results on benchmark functions and real-world problems indicate that its performance is competitive and serviceable and it is extremely efficient.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Junzhi Li, Ying Tan,