Scribd
Upload
12 views2 pages

Fireworks

This document describes the Fireworks Algorithm (FA), a novel swarm intelligence algorithm inspired by observing fireworks explosions. The FA uses two types of explosion (search) processes and mechanisms to maintain diversity among solutions. The authors compare the performance of the FA to two variants of Particle Swarm Optimization on benchmark optimization problems. Results show the FA converges faster and finds better solutions than the PSO variants.

Uploaded by

Vivi An
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views2 pages

Fireworks

This document describes the Fireworks Algorithm (FA), a novel swarm intelligence algorithm inspired by observing fireworks explosions. The FA uses two types of explosion (search) processes and mechanisms to maintain diversity among solutions. The authors compare the performance of the FA to two variants of Particle Swarm Optimization on benchmark optimization problems. Results show the FA converges faster and finds better solutions than the PSO variants.

Uploaded by

Vivi An
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Fireworks Algorithm for Optimization

Ying Tan and Yuanchun Zhu

Key Laboratory of Machine Perception (MOE), Peking University


Department of Machine Intelligence,
School of Electronics Engineering and Computer Science, Peking University,
Beijing, 100871, China
{ytan,ychzhu}@pku.edu.cn

Abstract. Inspired by observing fireworks explosion, a novel swarm in-


telligence algorithm, called Fireworks Algorithm (FA), is proposed for
global optimization of complex functions. In the proposed FA, two types
of explosion (search) processes are employed, and the mechanisms for
keeping diversity of sparks are also well designed. In order to demon-
strate the validation of the FA, a number of experiments were conducted
on nine benchmark test functions to compare the FA with two vari-
ants of particle swarm optimization (PSO) algorithms, namely Standard
PSO and Clonal PSO. It turns out from the results that the proposed FA
clearly outperforms the two variants of the PSOs in both convergence
speed and global solution accuracy.

Keywords: natural computing, swarm intelligence, fireworks algorithm,


particle swarm optimization, function optimization.

1 Introduction
In recent years, Swarm Intelligence (SI) has become popular among researchers
working on optimization problems all over the world [1,2]. SI algorithms, e.g. Par-
ticle Swarm Optimization (PSO) [3], Ant System [4], Clonal Selection Algorithm
[5], and Swarm Robots [6], etc., have advantages in solving many optimization
problems. Among all the SI algorithms, PSO is one of the most popular algorithm
for searching optimal locations in a D-dimensional space. In 1995, Kennedy and
Eberhart proposed PSO as a powerful global optimization algorithm inspired by
the behavior of bird blocks [3]. Since then, the PSO has attracted the attentions
of researchers around the globe, and a number of variants of PSO have been con-
tinually proposed [7, 8].
Like PSO, most of swarm intelligence algorithms are inspired by some intelli-
gent colony behaviors in nature. In this paper, inspired by the emergent swarm
behavior of fireworks, a novel swarm intelligence algorithm called Fireworks Al-
gorithm (FA) is proposed for function optimization. The FA is presented and
implemented by simulating the explosion process of fireworks. In the FA, two
explosion (search) processes are employed and mechanisms for keeping diversity
of sparks are also well designed. To validate the performance of the proposed
FA, comparison experiments were conducted on nine benchmark test functions

Y. Tan, Y. Shi, and K.C. Tan (Eds.): ICSI 2010, Part I, LNCS 6145, pp. 355–364, 2010.

c Springer-Verlag Berlin Heidelberg 2010
356 Y. Tan and Y.C. Zhu

among the FA, the Standard PSO (SPSO), and the Clonal PSO (CPSO) [8].
It is shown that the FA clearly outperforms the SPSO and the CPSO in both
optimization accuracy and convergence speed.
The remainder of this paper is organized as follows. Section 2 describes the
framework of the FA and introduces two types of search processes and mecha-
nisms for keeping diversity. In Section 3, experimental results are presented to
validate the performance of the FA. Section 4 concludes the paper.

2 Fireworks Algorithm

2.1 FA Framework

When a firework is set off, a shower of sparks will fill the local space around the
firework. In our opinion, the explosion process of a firework can be viewed as
a search in the local space around a specific point where the firework is set off
through the sparks generated in the explosion. When we are asked to find a point
xj satisfying f (xj ) = y, we can continually set off ‘fireworks’ in potential space
until one ‘spark’ targets or is fairly near the point xj . Mimicking the process of
setting off fireworks, a rough framework of the FA is depicted in Fig. 1.
In the FA, for each generation of explosion, we first select n locations, where
n fireworks are set off. Then after explosion, the locations of sparks are obtained
and evaluated. When the optimal location is found, the algorithm stops. Oth-
erwise, n other locations are selected from the current sparks and fireworks for
the next generation of explosion.
From Fig. 1, it can be seen that the success of the FA lies in a good design
of the explosion process and a proper method for selecting locations, which are
respectively elaborated in subsection 2.2 and subsection 2.3.

Select n initial locations

Set off n fireworks at n locations

Obtain the locations of sparks

Evaluate the quality of the locations

Optimal location
found Yes

No
Select n locations End

Fig. 1. Framework of fireworks algorithm

You might also like