Professional Documents
Culture Documents
Survey Paper
University of Maribor, Faculty of Electrical Engineering and Computer Science, Smetanova 17, 2000 Maribor, Slovenia
School of Science and Technology, Middlesex University, London NW4 4BT, UK
art ic l e i nf o
a b s t r a c t
Article history:
Received 10 December 2012
Received in revised form
8 June 2013
Accepted 14 June 2013
Available online 24 June 2013
The rey algorithm has become an increasingly important tool of Swarm Intelligence that has been
applied in almost all areas of optimization, as well as engineering practice. Many problems from various
areas have been successfully solved using the rey algorithm and its variants. In order to use the
algorithm to solve diverse problems, the original rey algorithm needs to be modied or hybridized.
This paper carries out a comprehensive review of this living and evolving discipline of Swarm
Intelligence, in order to show that the rey algorithm could be applied to every problem arising in
practice. On the other hand, it encourages new researchers and algorithm developers to use this simple
and yet very efcient algorithm for problem solving. It often guarantees that the obtained results will
meet the expectations.
& 2013 Elsevier B.V. All rights reserved.
Keywords:
Firey algorithm
Swarm intelligence
Nature-inspired algorithm
Optimization
1. Introduction
Swarm Intelligence (SI) belongs to an articial intelligence
discipline (AI) that became increasingly popular over the last
decade [1]. It is inspired from the collective behavior of social
swarms of ants, termites, bees, and worms, ock of birds, and
schools of sh. Although these swarms consist of relatively
unsophisticated individuals, they exhibit coordinated behavior
that directs the swarms to their desired goals. This usually
results in the self-organizing behavior of the whole system,
and collective intelligence or swarm intelligence is in essence
the self-organization of such multi-agent systems, based on simple
interaction rules. This coordinated behavior is performed due to
interaction between individuals, for example, termites and worms
are able to build sophisticated nests, while ants and bees also use
this collective behavior when searching for food. Typically, ants
interact with each other via chemical pheromone trails in order to
nd the shortest path between their nest and the food sources. In
a bee colony, the role of informer is played by so-called scouts, i.e.,
individual bees that are responsible for searching for new promising areas of food sources. Here, the communication among bees is
realized by a so-called waggle dance, through which the bee
colony is directed by scouts. During this discovery of the new food
sources, a trade-off between exploration (the collection of new
information) and exploitation (the use of existing information)
must be performed by the bee colony [2]. That is, the bee colony
must be aware when to exploit existing food sources and when to
n
35
been applied. Let us mention only the most important areas of its
application: continuous, combinatorial, constraint and multiobjective optimization, and optimization in dynamic and noisy
environments. Beside optimization, it is applicable for solving
classication problems arose in areas like machine learning, data
mining, and neural network. Additionally, many applications cover
an area of engineering applications and solve real-world problems.
Section 4 brings the discussion of FA behavior and directions for
further development of these algorithms are covered. This paper
concludes with an overview of the work that has been performed
within the discipline of swarm intelligence.
2. Firey algorithm
2.1. Biological foundations
Fireies (Coleoptera: Lampyridae) are among the most
charismatic of all insects, and their spectacular courtship displays
have inspired poets and scientists alike [23]. Nowadays, more that
2000 species exist worldwide. Usually, reies live in a variety of
warm environments and they are most active in summer nights. A
lot of researchers have studied rey phenomena in nature and
there exist numerous papers researching reies, for example,
[2428].
Fireies are characterized by their ashing light produced by
biochemical process bioluminescence. Such ashing light may
serve as the primary courtship signals for mating. Besides attracting mating partners, the ashing light may also serve to warn off
potential predators. Note that in some rey species some adults
are incapable of bioluminescence. These species attract their
mates due to pheromone, similarly to ants.
In reies, bioluminescent reactions take place from lightproducing organs called lanterns. The most bioluminescent organisms provide only slowly modulated ashes (also glows). In
contrast, adults in many rey species are able to control their
bioluminescence in order to emit high and discrete ashes. The
lanterns' light-production is initialized by signals originating
within the central nervous system of rey.
Most rey species rely on bioluminescent courtship signals.
Typically, the rst signalers are ying males, who try to attract
ightless females on the ground. In response to these signals, the
females emit continuous or ashing lights. Both mating partners
produce distinct ash signal patterns that are precisely timed in
order to encode information like species identity and sex. Females
are attracted according to behavioral differences in the courtship
signal. Typically, females prefer brighter male ashes. It is well
known that the ash intensity varies with the distance from the
source. Fortunately, in some rey species females cannot discriminate between more distant ashes produced by stronger light
source and closer ashes produced by weaker light sources.
Firey ash signals are highly conspicuous and may therefore
deter a wide variety of potential predators. In the sense of natural
selection [29], where only the strongest individual can survive,
ash signals evolve as defense mechanisms that serve to warn
potential predators.
Two features are characteristics for swarm intelligence: selforganization and decentralized decision making. Here, autonomous
individuals live together in a common place as, for example, bees in
hives, ants in anthills, etc. In order to live in harmony, some
interaction or communication is needed among group members
who live together (sociality). In fact, individuals within a group
cannot behave as if they are solitary, but must adapt to the overall
goals within the groups. The social life of reies is not just dedicated
to foraging, but more to reproduction. These collective decisions are
36
closely connected with the ashing light behavior that served as the
main biological foundation for developing the rey algorithm.
2.2. Structure of the rey algorithm
As mentioned in Section 1, this paper focuses on Yang's [9]
implementation of the rey algorithm. This algorithm is based on
a physical formula of light intensity I that decreases with the
increase in the square of the distance r2. However, as the distance
from the light source increases, the light absorption causes that
light becomes weaker and weaker. These phenomena can be
associated with the objective function to be optimized. As a result,
the base FA can be formulated as illustrated in Algorithm 1.
Some ashing characteristics of the reies are idealized in
order to formulate the FA, as follows:
Algorithm 1. Pseudo-code of the base Firey algorithm.
1:
2:
3:
4:
5:
6:
7:
t 0; sn ; 1:0;
// initialize: gen.counter, best
solution, attractiveness
where I0 denotes the light intensity of the source, and the light
absorption is approximated using the xed light absorption
coefcient . The singularity at r 0 in the expression I=r 2 is
avoided by combining the effects of the inverse square law and
an approximation of absorption in Gaussian form. The attractiveness of reies is proportional to their light intensities I(r).
Therefore, a similar equation to Eq. (1) can be dened, in order to
describe the attractiveness
0 er ;
2
sik sjk 2 ;
r ij si sj
k1
P InitializeFA;
// initialize a population
while t o MAX_FES do
t AlphaNew;
// determine a new value of
EvaluateFAP t ; f s;
// evaluate s according to f s
OrderFAP t ; f s;
n
// sort s according to f s
t
s FindTheBestFAP ; f s;
solution
P t1 MoveFAP t ;
accordingly
9:
t t 1;
10: end while
8:
where n denotes the dimensionality of the problem. The movement of the i-th rey is attracted to another more attractive
rey j. In this manner, the following equation is applied:
si si 0 erij sj si i ;
What is modied?
How are the modications made?
What is the scope of the modications?
From the rst aspect, rey algorithms can be classied
according to the components or features of which they consists.
These are
37
38
References
[9]
[33]
[35]
[36,37,45]
Table 2
Modied rey algorithms.
Topic
References
[46]
[4749,65]
[54,55]
[55,58,59]
[60,62]
[63,64]
39
40
due to the fact that local attraction is stronger than longdistance attraction. As a result, FA can deal with highly nonlinear, multi-modal optimization problems naturally and
efciently.
FA does not use historical individual best sni , and there is no
explicit global best gn either. This avoids any potential drawbacks of premature convergence as those in PSO. In addition, FA
does not use velocities, and there is no problem as that
associated with velocity in PSO.
FA has an ability to control its modality and adapt to problem
landscape by controlling its scaling parameter such as . In fact,
FA is a generalization of SA, PSO and DE, as seen clearly in the
next paragraph.
References
[66]
[68,65]
[69]
[73]
[78,79]
[80,65]
[81]
annealing and differential evolution. Although FA was very efcient, oscillatory behavior was observed as the search process
approached the optimum design. The overall behavior of FA could
be improved by gradually reducing the randomization parameter
as the optimization progressed.
Combinatorial optimization: FA is also employed for solving
combinatorial optimization problems. Durkota in his BSc thesis
[83] adjusted FA to solve the class of discrete problems named
Quadratic Assignment Problem (QAP), where the solutions are
represented as permutations of integers. In this algorithm, the
continuous functions, like attractiveness, distance and movement,
were mapped into newly developed discrete functions. The
experimental results were obtained on 11 different QAP problems
chosen from the public QAPLIB Library. The author reported fast
convergence and success rate on the simplest problems, while the
algorithm often falls into the local optima by solving the hard
problems.
The paper of Sayadi et al. [84] presented a new discrete rey
meta-heuristic for minimizing the makespan for the permutation
ow shop scheduling problem that is classied as a NP-hard
problem. The results of the proposed algorithm were compared
with other existing ant colony optimization technique and indicated that it performs better than the ant colony for some wellknown benchmark problems.
The rst approach to apply the rey meta-heuristic to the task
graph scheduling problem (NP-hard problem) was performed by
Hnig [85]. The results on an extensive experimental benchmark
with 36,000 task graph scheduling problems showed that the
presented algorithm required less computing time than all the
other meta-heuristics used in the test, but these were not as
promising when the other performance measures were taken into
account.
Jati et al. [86] applied FA to the symmetric traveling salesman
problem that is a well-known NP-hard problem. In this evolutionary discrete FA (EDFA), a permutation representation was
used, where an element of array represents a city and the index
represents the order of a tour. m-moves were generated for each
rey using inversion mutation. The simulation results indicated
that the EDFA performed very well for some TSPLIB instances
when compared to the memetic algorithm. Unfortunately, it can
often be trapped into local optimum.
Khadwilard et al. [87] developed FA for solving the Job shop
scheduling problem (JSSP). A computational experiment was
conducted using ve benchmark datasets of the JSSP instance
from the well-known OR-Library [88], for nding the lowest
makespan. The authors reported that although this FA could found
the best known solution in some cases, it was also trapped into the
local optima several times.
In [89] the authors Liu et al. proposed a path planning adaptive
rey algorithm. Here, the random and absorption parameters
were designed to be adaptive in order to improve the solution
quality and convergence speed of the classical rey algorithm.
The simulation tests veried the effectiveness of the improved
algorithm and the feasibility of the path-planning method based
on the rey algorithm. In addition, Wang et al. [90] developed a
new modied FA (MFA) for solving the path planning problem for
uninhabited combat air vehicle (UCAV), where a modication is
applied for exchanging information between top reies during
the process of light intensity updating. This modication accelerated the global convergence speed, while preserving the strong
robustness of the classical rey algorithm. In order to prove the
performance of this algorithm, MFA was compared with classical
FA and other population-based optimization algorithms like ant
colony optimization (ACO) [4], biogeography-based optimization
(BBO) [91], differential evolution (DE) [70], evolutionary strategy
(ES) [92], genetic algorithm (GA) [93], probability-based
41
42
Table 4
Optimization applications.
Topic
References
Continuous optimization
Combinatorial optimization
Constrained Optimization
Multi-objective optimization
Dynamic and noisy environment
[35,55,36,58,59,82]
[8387,89,90,96]
[97,82,98]
[100,107,108]
[109,114116,121]
Table 5
Engineering applications.
Engineering area
References
Total
Industrial Optimization
Image processing
Antenna design
Business optimization
Civil engineering
Robotics
Semantic web
Chemistry
Meteorology
Wireless sensor networks
[135148]
[149156]
[157160]
[161,162]
[163,164]
[165,166]
[167]
[168]
[169]
[170]
14
8
4
2
2
2
1
1
1
1
43
6. Conclusions
FA algorithm has widely expanded its application domains
since its establishment in 2008. Nowadays, there is practically no
domain where FA had not been applied. Moreover, the development areas of this algorithm are very dynamic, because new
applications appear almost every day.
This paper performs a comprehensive review of the rey
algorithm. It has shown that this algorithm:
44
45
scheduling problems, International Journal of Industrial Engineering Computations 1 (1) (2010) 110.
[85] U. Hnig, A rey algorithm-based approach for scheduling task graphs in
homogeneous systems, in: Informatics, ACTA Press, 2010, pp. 2433.
[86] G. Jati, Evolutionary discrete rey algorithm for travelling salesman
problem, Adaptive and Intelligent Systems (2011) 393403.
[87] A. Khadwilard, S. Chansombat, T. Thepphakorn, P. Thapatsuwan, W. Chainate,
P. Pongcharoen, Application of rey algorithm and its parameter setting for
job shop scheduling, in: The First Symposium on Hands-On Research and
Development, 2011, pp. 110.
[88] J. Beasley, Or-library: distributing test problems by electronic mail, Journal of
the Operational Research Society 41 (1990) 10691072.
[89] C. Liu, Z. Gao, W. Zhao, A new path planning method based on rey
algorithm, in: The Fifth International Joint Conference on Computational
Sciences and Optimization (CSO-2012), IEEE, 2012, pp. 775778.
[90] G. Wang, L. Guo, H. Duan, L. Liu, H. Wang, A modied rey algorithm for
UCAV path planning, International Journal of Hybrid Information Technology
5 (3) (2012) 123144.
[91] D. Simon, Biogeography-based optimization, IEEE Transactions on Evolutionary Compututation 12 (2008) 702713.
[92] T. Back, Evolutionary Algorithms in Theory and Practice, Oxford University
Press, Oxford, 1996.
[93] D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine
Learning, Addison-Wesley, MA, 1996.
[94] B. Shumeet, Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning,
Technical Report, Carnegie Mellon University, Pittsburgh, 1994.
[95] W. Khatib, P. Fleming, The stud GA: a mini revolution?, in: A. Eiben, T. Back,
M. Schoenauer, H. Schwefel (Eds.), Parallel Problem Solving from Nature,
Springer Verlag, New York, 1998, pp. 683691.
[96] J. Kwiecie, B. Filipowicz, Firey algorithm in optimization of queueing
systems, Technical Sciences 60 (2) (2012) 363368.
[97] S. ukasik, S. ak, Firey algorithm for continuous constrained optimization
tasks, in: N.T. Nguyen, R. Kowalczyk, S.-M. Chen (Eds.), Computational
Collective Intelligence, Semantic Web, Social Networks and Multiagent
Systems, Springer, 2009, pp. 97106.
[98] H. Gomes, A rey metaheuristic structural size and shape optimisation with
natural frequency constraints, International Journal of Metaheuristics 2 (1)
(2012) 3855.
[99] A. Zhou, B.-Y. Qu, H. Li, S.-Z. Zhao, P.N. Suganthan, Q. Zhang, Multiobjective
evolutionary algorithms: a survey of the state of the art, Swarm and
Evolutionary Computation 1 (1) (2011) 3249.
[100] X.S. Yang, Multiobjective rey algorithm for continuous optimization,
Engineering with Computers 29 (2013) 175184.
[101] R. Falcon, M. Almeida, A. Nayak, Multiple objective optimization with vector
evaluated genetic algorithms, in: Proceedings of the First International
Conference, Genetic Algorithms, 1985, pp. 93100.
[102] K. Deb, A. Pratap, S. Agarwal, T. Mayarivan, A fast and elitist multiobjective
algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation 6 (2002)
182197.
[103] B. Babu, A. Gujarathi, Multi-objective differential evolution (mode) for
optimization of supply chain planning and management, in: IEEE Congress
on Evolutionary Computation (CEC 2007), IEEE, 2007, pp. 27322739.
[104] T. Robi, B. Filipi, Demo: differential evolution for multi-objective optimization, in: C. Coello, A.A.E. Zitzler (Eds.), Lecture Notes on Computer Science,
EMO 2005, Springer Verlag, New York, 2005, pp. 520533.
[105] R. Falcon, M. Almeida, A. Nayak, Multi-objective optimisation using the bees
algorithm, in: The Third International Virtual Conference on Intelligent
Production Machines and Systems (IPROMS 2007), Whittles, Dunbeath,
Scotland, 2007, pp. 15.
[106] E. Zitzler, L. Thiele, Multiobjective evolutionary algorithms: a comparative
case study and the strength pareto approach, IEEE Transactions on Evolutionary Compututation 3 (4) (1999) 257271.
[107] O. Abedinia, N. Amjady, M. Naderi, Multi-objective environmental/economic
dispatch using rey technique, in: The 11th International Conference on
Environment and Electrical Engineering (EEEIC 2012), IEEE, 2012, pp. 461466.
[108] T. Niknam, R. Azizipanah-Abarghooee, A. Roosta, B. Amiri, A new multiobjective reserve constrained combined heat and power dynamic economic
emission dispatch, Energy 42 (2012) 530545.
[109] A. Abshouri, M. Meybodi, A. Bakhtiary, New rey algorithm based on multi
swarm & learning automata in dynamic environments, in: IEEE Proceedings,
2011, pp. 7377.
[110] J. Branke, Memory enhanced evolutionary algorithms for changing optimization problems, in: Proceedings of the Congress on Evolutionary Computation
99, vol. 3, IEEE, 1999, pp. 18.
[111] T. Blackwell, J. Branke, Multiswarms, exclusion, and anticonvergence in
dynamic environments, IEEE Transactions on Evolutionary Computation 10
(2006) 459472.
[112] C. Li, S. Yang, Fast multi-swarm optimization for dynamic optimization
problems, in: The Fourth International Conference on Natural Computation,
vol. 7, Jinan, Shandong, China, 2008, pp. 624628.
[113] A. Hashemi, M. Meybodi, Cellular PSO: a PSO for dynamic environments,
Advances in Computation and Intelligence (2009) 422433.
[114] N. Chai-ead, P. Aungkulanon, P. Luangpaiboon, Bees and rey algorithms for
noisy non-linear optimization problems, in: Proceedings of the International Multi
Conference of Engineering and Computer Scientists, vol. 2, 2011, pp. 14491454.
46
[146]
[147]
[148]
[149]
[150]
[151]
[152]
[153]
[154]
[155]
[156]
[157]
[158]
[159]
[160]
[161]
[162]
[163]
[164]
[165]
[166]
[167]
[168]
[169]
[170]
[171]
[172]
Proceedings of the Federated Conference on Computer Science and Information Systems, IEEE, 2012, pp. 455462.
O. Roeva, Optimization of E. coli cultivation model parameters using rey
algorithm, International Journal of Bioautomation 16 (2012) 2332.
O. Abedinia, N. Amjady, K. Kiani, H. Shayanfar, Fuzzy PID based on rey algorithm: load frequency control in deregulated environment, in: The 2012 International Conference on Bioinformatics and Computational Biology, 2012, pp. 17.
R. Dutta, R. Ganguli, V. Mani, Exploring isospectral springmass systems with
rey algorithm, Proceedings of the Royal Society A: Mathematical, Physical
and Engineering Science 467 (2011) 32223240.
Y. Zhang, L. Wu, A novel method for rigid image registration based on rey
algorithm, International Journal of Research and Reviews in Soft and
Intelligent Computing (IJRRSIC) 2 (2) (2012) 141146.
M. Horng, T. Jiang, The codebook design of image vector quantization based
on the rey algorithm, Computational Collective Intelligence. Technologies
and Applications (2010) 438447.
M. Horng, Vector quantization using the rey algorithm for image compression, Expert Systems with Applications 39 (1) (2012) 10781091.
T. Hassanzadeh, H. Vojodi, F. Mahmoudi, Non-linear grayscale image
enhancement based on rey algorithm, in: B.K. Panigrahi, P.N. Suganthan,
S. Das, S.C. Satapathy (Eds.), Swarm, Evolutionary, and Memetic Computing,
Springer, 2011, pp. 174181.
T. Hassanzadeh, H. Vojodi, A. Moghadam, An image segmentation approach
based on maximum variance intra-cluster method and rey algorithm, in:
The Seventh International Conference on Natural Computation (ICNC 2011),
vol. 3, IEEE, 2011, pp. 18171821.
M. Mohd Noor, A. Ahmad, Z. Hussain, K. Ahmad, A. Ainihayati, Multilevel
thresholding of gel electrophoresis images using rey algorithm, in: IEEE
International Conference on Control System, Computing and Engineering
(ICCSCE 2011), IEEE, 2011, pp. 1821.
M. Horng, T. Jiang, Multilevel image thresholding selection based on the
rey algorithm, in: Ubiquitous Intelligence & Computing and Seventh
International Conference on Autonomic & Trusted Computing (UIC/ATC),
IEEE, 2010, pp. 5863.
M. Horng, R. Liou, Multilevel minimum cross entropy threshold selection
based on the rey algorithm, Expert Systems with Applications 38 (12)
(2011) 1480514811.
B. Basu, G. Mahanti, Fire y and articial bees colony algorithm for synthesis
of scanned and broadside linear array antenna, Progress in Electromagnetics
Research B 32 (2011) 169190.
M. Zaman, A. Matin, et al., Nonuniformly spaced linear antenna array design
using rey algorithm, International Journal of Microwave Science and
Technology 2012 (2012) 256759 (8 pp).
A. Chatterjee, G. Mahanti, Minimization in variations of different parameters
in different planes of a small-size concentric ring array antenna using
rey algorithm, Annals of Telecommunications 20 (2012) 18.
B. Basu, G. Mahanti, Thinning of concentric two-ring circular array antenna
using re y algorithm, Scientia Iranica 19 (6) (2012) 18021809.
X.S. Yang, S. Deb, S. Fong, Accelerated particle swarm optimization and
support vector machine for business optimization and applications, Networked Digital Technologies (2011) 5366.
G. Giannakouris, V. Vassiliadis, G. Dounias, Experimental study on a hybrid
nature-inspired algorithm for nancial portfolio optimization, Articial
Intelligence: Theories, Models and Applications (2010) 101111.
S. Talatahari, A. Gandomi, G. Yun, Optimum design of tower structures using
rey algorithm, The Structural Design of Tall and Special Buildings doi:
http://dx.doi.org/10.1002/tal.1043.
S. Gholizadeh, H. Barati, A comparative study of three metaheuristics for
optimum design of trusses, International Journal of Optimization in Civil
Engineering 3 (2012) 423441.
B. Jakimovski, B. Meyer, E. Maehle, Firey ashing synchronization as
inspiration for self-synchronization of walking robot gait patterns using a
decentralized robot control architecture, Architecture of Computing Systems
ARCS 2010 (2010) 6172.
S. Severin, J. Rossmann, A comparison of different metaheuristic algorithms
for optimizing blended PTP movements for industrial robots, Intelligent
Robotics and Applications (2012) 321330.
C. Pop, V. Chifu, I. Salomie, R. Baico, M. Dinsoreanu, G. Copil, A hybrid reyinspired approach for optimal semantic web service composition, Scalable
Computing: Practice and Experience 12 (2011) 363369.
S.E. Fateen, A. Bonilla-Petriciolet, G.P. Rangaiah, Evaluation of covariance matrix
adaptation evolution strategy, shufed complex evolution and rey algorithms
for phase stability, phase equilibrium and chemical equilibrium problems,
Chemical Engineering Research and Design 90 (12) (2012) 20512071.
A.F.d. Santos, H.F.d. Campos Velho, E.F. Luz, S.R. Freitas, G. Grell, M.A. Gan,
Firey optimization to determine the precipitation eld on South America,
Inverse Problems in Science and Engineering (2013) 116.
M. Breza, J. McCann, Lessons in implementing bio-inspired algorithms on
wireless sensor networks, in: NASA/ESA Conference on Adaptive Hardware
and Systems (AHS'08), IEEE, 2008, pp. 271276.
A. Zamuda, J. Brest, Population reduction differential evolution with multiple
mutation strategies in real world industry challenges, in: ICAISC (SIDE-EC),
2012, pp. 154161.
R. Mallipeddi, P. Suganthan, Q. Pan, M. Tasgetiren, Differential evolution
algorithm with ensemble of parameters and mutation strategies, Applied Soft
Computing 11 (2) (2011) 16791696.