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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
