International Journal of Computer Information Systems and Industrial Management Applications.

ISSN 2150-7988 Volume 9 (2017) pp. 181-205

© MIR Labs, www.mirlabs.net/ijcisim/index.html

Glossary of Metaheuristic Algorithms

Jitendra Rajpurohit1, Tarun Kumar Sharma2 Ajith Abraham3 and Vaishali4
1, 2, 4Amity University Rajasthan,

Kant Kalwar, Jaipur 303002, India

[email protected]
[email protected]
[email protected]

3Machine Intelligence Research Labs (MIR Labs)

P.O. Box 2259, Auburn, Washington 98071-2259, USA

[email protected]

Global Maxima
Abstract: Metaheuristic algorithms have been an interesting Local Maxima
area for researchers, scientists and academicians due to their Local Maxima

specific and significant characteristics and capabilities. Their Local Maxima

ability to solve and give near optimal solutions to the problems Local Minima Local Minima
y Local Minima
of versatile domain without in-depth details and definition of the Global Minima
problems, provides an edge over traditional techniques. Most of
the metaheuristic algorithms are inspired by some real world Figure 1. Pictorial
x
representation of local and
phenomenon, generally a natural method of optimization. Over global optima
the last few decades a number of metaheuristic algorithms have
been introduced and applied on various problems of different
There are many categorizations provided for various
domains. This paper is aimed to provide the researchers of the optimization approaches. One such categorization is
field with a comprehensive list of such algorithms developed so shown in figure 2. Deterministic methods are unable to
far. The algorithms are listed in alphabetical order having solve non-linear problems, heuristic search methods
authors’ credentials and a brief discussion of the method. The provide near optimum and acceptable solutions to such
aim of this work is to provide an introduction of the field to the problems. Metaheuristic search methods are a category of
new and interested researchers. algorithms that do not require detailed information of the
search space; rather they need the objective function and
Keywords: Nature Inspired Algorithms, Metaheuristic Algorithms. domain of the variables. Algorithms falling in further
categories of metaheuristic search methods often overlap
in more than one categories.
I. Introduction
Optimization Approaches
Optimization refers to the process of finding out the best
available solution to a problem. When modeled
mathematically, optimization generally figures out to be
Traditional (Deterministic) Heuristic methods
a method of finding out optimized value of a function
(objective/fitness function). Equation (1) is an example of
such optimization. This process of optimization is
generally performed under some system imposed binding Evolutionary Other nature Logical search
conditions known as constraints. Optimization may have algorithms inspired algorithms algorithms
single objective or multiple objectives. There may be
many maxima or minima in a search space. All of them
may not be necessarily the best solutions. Finding out any Genetic Ant Colony Tabu search
of these local optima may disguise the search method of algorithms Optimization
Particle Swarm Harmony search
successfully optimizing the problem (Figure 1). Global Artificial bee
Optimization colony ….
optimization refers to finding out the global optimum
Differential Ions motion
avoiding local optima. Evolution algorithm ….
…. …. ….
….
Minimize f(x) = ∑𝐷 2
𝑖=1[𝑥𝑖 − 10 cos(2𝜋𝑥𝑖 ) + 10] (1) Figure 2. A categorization of optimization approaches
where −5.12 < 𝑥𝑖 < 5.12
An Evolutionary Algorithm (EA) initializes with few random
member solutions and continues searching for the best
solution governed by rules of the specific algorithm. The best
solution after each generation is either equal or better than the

Dynamic Publishers, Inc., USA

182 Rajpurohit, Sharma et al.

previous generation. Most of the researchers working in the made processes like brain-storming, scientists’ cooperation,
field of EA chose a few algorithms to work upon, but only a consultation, tournaments, grenade blast , teaching-learning,
few attempts have been made to figure out that how many such society, exchange market etc. Many natural processes like
algorithms have been developed [1]. galaxies, big bang, river formation, chemical reactions, cloud
"Till now, madness has been thought a small island formation, crystals, electromagnetism, gravitation etc. have
in an ocean of sanity. I am beginning to suspect that also been able to inspire the researchers. Few very weird and
it is not an island at all but a continent." -Machado hypothetical concepts like zombies, reincarnation, flying
de Assis, The Psychiatrist. elephants etc. have also been used. EAs can be divided into
nine groups according to the method they are inspired by [2].
When the work of creating a list of all of them started, the These groups are: biology-based, physics-based, social-based,
above sentence of Assis felt to be true. EA’s have been in music-based, chemical – based, sport – based, mathematics –
existence for more than a half century. It is a computational based, swarm – based, and hybrid methods which are
method that has enabled researchers and mathematicians to combinations of these. In this paper, we are presenting a
solve problems that cannot be solved by conventional glossary of evolutionary algorithms with their brief
computational strategies. Almost all the evolutionary descriptions.
computational methods are inspired by some real world
phenomenon. Figure 3 illustrates the process of development
of an EA. Nature and its species have evolved for millions of
II. Glossary of Metaheuristic Algorithms
years to optimize their problem solving skills. Development of EAs started way back in 1960s. The rate of
introduction of new and innovative EAs has increased
continuously since then. Steep increase in the cumulative
Real number of EAs over the last decade indicates increasing
world Evolutionary number of researchers contributing to the field. Figure 4 gives
event/ algorithm an idea of cumulative number of algorithms over the years.
phenomen
200
180
Cumulative number of

160
Observe and Simulate 140
inspire
algorithms

Test 120
Refine 100
80
Idea 60
Model 40
Develop 20
0
Figure 3. Process of development of an EA 1961 1966 1971 1976 1981 1986 1991 1996 2001 2006 2011 2016
Year
Most of the evolutionary algorithms are thus based on these
problem solving strategies adopted by natural species. Even
the strangest of the species have evolved over time and have
the ability to act as a basis of an EA. Few such species are Figure 4. Increasing cumulative number of EAs over the
insects, mammals, birds, fishes and many more. Many of the years
weird species have also been studied and used to base an EA Table 1 contains the glossary of metaheuristics found so far.
like bacteria, sperm, Japanese tree frog, raven, blind naked- The discussion has been kept limited to a brief introduction of
mole rats, dragon-fly, glowworm, krill etc. Many EAs draw the method and not many technical details. Attempts have
inspiration from plants also. Algorithms based on runner-root, been made to include each existing method but still there may
plant growth, paddy, strawberry etc. exist. Humans being the be a few algorithms left out.
most intelligent species have also contributed to inspire many
algorithms. Algorithms were also found inspired by man-

Table 1. Glossary of Metaheuristic Algorithms

Algorithm Authors ( Year) Brief Description
A
African Buffalo J.B. Odili and M.N. Mohmad Inspired from the intelligence, organizational skills
Optimization [3] Kahar (2016) and navigational skills displayed by African buffalos
in search of food
African Wild Dog C. Subramanian , A.S.S. Communal hunting behavior of African wild dogs.
Algorithm [4] Sekar and K. Subramanian (2013) Does not require any parameter other than pack size
and termination criteria
Glossary of Evolutionary Algorithms 183

Anarchic Society H. Shayeghi and J. Dadashpour Models the problem in the form of a group of anarchist
Optimization [5] (2012) individuals fickle, adventurous and dislike stability to
overcome the trapping in local optima.
Animal Migration Xiangtao Li, Jie Zhang and Inspired by migration of animals in groups and how
Optimization Algorithm [6] Minghao Yin(2014) they leave a group and join another for survival.
Ant Colony Optimization A. Colorni, M. Dorigo, V. Inspired by the method used by ants to search path
[7] Maniezzo (1991) between their colony and food source. Ants use
pheromone trails to find the best food source.
Pheromone evaporates with time, so shorter paths
have less time to evaporate and are more attractive.
Ant Lion [8] S. Mirjalili (2015) Mimics the hunting behavior of antlions. Models the
algorithm based on five basic steps i.e. random
searching, building traps, entrapping preys, catching
prey and rebuilding trap.
Artificial Algae Algorithm Sait Ali, Uymaz, GulayTezel and Involves evolutionary process, adaptation and helical
[9] Esra Yel (2015) movement of Algae.
Artificial Bee Colony Dervis Karaboga and Bahriye A colony of artificial bees is created having three types
Algorithm (ABC) [10] Basturk (2007) of bees namely employed bees, onlooker bees and
scouts. These bees communicate with each other to
optimize food search around their hive.
Artificial Chemical Bilal Alatas (2011) Models the optimization problem in terms of objects,
Reaction Optimization states, processes and events of a chemical reaction.
Algorithm [11] Uses the natural tendency of chemical reactions to
move towards highest entropy and lowest enthalpy.
Artificial Cooperative Pinar Civicioglu (2013) Mutualism based biological interaction between two
Search [12] living species for mutual benefits.
Artificial Ecosystem Manal T. Adham and Peter J. Property of ecosystem being distributed in many sub-
Algorithm [13] Bentley (2014) components but to synergize with each other to evolve
as a whole.
Artificial Fish School X.L. Li, Z.J. Shao and J.X. Qian Method used by fish swarm to search for food and
Algorithm [14] (2002) avoid dangers to the colony. Three basic behaviors of
fishes are modeled namely prey, swarm and follow.
Artificial Plant Optimization Jun Li, Zhihua Cui and Zhongzhi Based on the growing process of plants. There are
Algorithm [15] Shi (2012) three operators i.e. photosynthesis operator,
phototropism operator and apical dominance to match
the actual process of plant growth.
Artificial Searching Swarm T. Chen (2009) Based on the principles of Bionic Intelligent
Algorithm [16] Optimization algorithm. If an individual member of
the population finds a better solution it communicates
with the other members and they move towards this
solution by one step. If the individual does not receive
any peer communication than it moves according to
the historical pattern. Still, if it does not find a better
solution than it moves randomly.
Atmosphere Clouds Model Gao Wei Yan and Zhan Ju Hao Imitates the generation, moving and spreading
[17] (2013) behavior of clouds for exploration, movement within
and exploitation of the search space
B

Backtracking Search Pinar Civicioglu (2013) Has a single control parameter. Trial population is
Optimization [18] generated using two new crossover and mutation
operators. Has a memory to store a random previous
generation to assist in search
Bacteria Chemotaxis S.D. Muller, J. Marchetto , S. Survival strategies used by bacteria such as acquiring
Algorithm [19] Airaghi and P. Kournoutsakos, information from the environment, using this
2002
184 Rajpurohit, Sharma et al.

information for adapting to the environment and

survive.
Bacterial Colony Ben Niu and Hong Wang (2012) Based on development behaviors of Escherichia coli
Optimization [20] like chemotaxis, communication, elimination,
reproduction, and migration.
Bacterial Evolutionary Swagatam Das , Archana It is an evolutionary clustering method to partition data
Algorithm [21] Chowdhury and Ajith Abraham sets into optimal number of groups. BEA is inspired
(2009) by microbial evolution. Uses two special operators i.e.
bacterial mutation and gene transfer operation.
Bacterial Foraging K.M. Passino (2002) Property of natural selection to eliminate individuals
Algorithm [22] with poor foraging strategies such as locating,
handling and absorbing food and at the same time
favoring the individuals with good foraging strategies.
Bacterial Swarming [23] Ying Chu, Hua Mi and Huilian Combines the foraging process of E-coli from
Liao (2008) Bacterial Foraging Algorithm and the swarming
process of Particle Swarm Optimization. Few new
operators like attraction factor and adaptive step length
are also incorporated.
Bat Algorithm [24] Xin-She Yang (2010) Inspired by echolocation behavior of bats which they
use to search directions and location of insects. It also
combines the advantages of other nature inspired
algorithms
Big bang-big Crunch [25] Osman K. Erol and Ibrahim Eksin Mimics the theory of evolution of the universe the big-
(2006) bang big-crunch theory. In the big-bang phase
particles are randomly distributed and in the big-
crunch phase the random particles are arranged in an
order.
Biogeography Based Dan Simon (2008) Inspired by geographical distribution of biological
Optimization [26] organisms. Uses basic operators like migration and
mutation
Bird Mating Optimizer [27] Alireza Askarzadeh (2014) Imitates the mating strategies used by birds. Methods
adopted by bird species to select superior genes is
replicated to find optimum solution of continuous
optimization functions
Bird Swarm [28] Xian-Bing Meng, X.Z. Gao, Based on foraging, vigilance and flight behaviors of
Lihua Lu, Yu Liu & Hengzhen birds shown in bird swarms.
Zhang (2016)
Black Holes Algorithm [29] Abdolreza Hatamlou (2013) Inspired by the black hole phenomenon. At each
iteration, the best candidate solution is selected to be
the black hole which then attracts all the other
solutions (stars) towards it. If a star gets too close to
the black hole it merges with the black hole and a new
random star is generated.
Blind, Naked Mole-rats Mohammad Taherdangkoo, It is a data clustering algorithm that imitates the social
Algorithm [30] Mohammad Hossein Shirzadi , behavior of blind, naked mole rates displayed to search
Mehran Yazdi food and protection of their colony.
and Mohammad Hadi Bagheri
(2013)
Brain Storm Optimization Y. Shi (2015) Inspired by the brain storming process for problem
[31] solution. Introduces two variants BSO-I and BSO-II.
Operators like inter-cluster distance and inter-cluster
diversity are used to monitor cluster centroids and
entropy during iterations.
Bull Optimization Oguz FINDIK, 2015 Modifies the selection process of Genetic Algorithm.
Algorithm [32] Allows only the best individuals to participate in the
crossover operation.
Bumble Bees Mating F. Comellas and J. Martinez Mimics the colony of insects bumble bees. Correlates
Optimization [33] Navarro (2009) fitness of each bumble bee with its life span to
eliminate worst bees and retain better solutions.
Glossary of Evolutionary Algorithms 185

Camel Algorithm [34] M. K. Ibrahim, R. S. Ali, (2016) Inspired by camel’s travelling behavior in the desert.
Uses several factors and operators like temperature
effect, water supply, endurance, visibility, land
conditions etc.
Cat Swarm Optimization Shu-Chuan Chu, Pei-Wei Tsai, Based on the behavior of cats. Has two sub models
[35] and Jeng-Shyang Pan (2006) namely tracing mode and seeking mode. Member
solutions are termed as cats. Each cat has an associated
velocity for each dimension, a fitness value and a flag
representing its mode.
Central Force Optimization Richard A. Formato (2007) Models the movement of bodies under gravitational
[36] force. Uses the principle that moving bodies moving
in space are trapped in close orbits around massive
objects which is similar to finding out optimum value
of a function.
Charged System Search [37] A. Kaveh, and S. Talatahari A multi-agent model where each agent is termed as a
(2010) charged particle. Uses the theories of electro-magnetic
and gravitational forces. Each charged particle attracts
each other based upon its fitness and mutual distance.
Chicken Swarm [38] Xianbing Meng, Yu Liu, Simulates the hierarchical behavior of chicken swarm.
Xiaozhi Gao, Hengzhen Zhang Includes roosters, hens and chicks. The swarm is
(2014) divided into several groups each having a rooster and
many hens and chicks. Chickens compete in a specific
hierarchical order.
Clonal Selection Algorithm L.N. de Castro, F.J. von Zuben Simulates the method used by the immune system to
[39] (2000) decide about the basic features of the immune
response for an antigenic stimulus. Uses the idea that
only the cells that recognize the antigen participate in
the response
Cockroach Swarm I. C. Obagbuwa and A. O. Inspired by the cockroaches. Models three basic
Optimization [40] Adewumi (2014) tendencies of cockroaches namely chase-swarming,
dispersion and ruthlessness. Algorithm investigates
the specific behaviors of cockroaches like interaction
with each other for searching food, making friends,
dispersion when in danger and ruthless eating of peers
when in need.
Colliding Bodies A. Kaveh and V. R. Mahdavi Member solutions are termed as bodies in one
Optimization [41] (2014) dimensional space. These bodies then collide with
specific velocities. After the collision, the bodies have
new velocities. These collisions make the bodies to
search for better positions.
Community of Scientist Alfredo Milani and Valentino Inspired by the social behavior within community of
Optimization [42] Santucci (2012) scientists to share results and arrange funds needed for
their research activities. The framework involves
competition for research funds, developing
communication channels and evolving research
strategies.
Consultant-guided Search S. Iordache (2009) Based on the direct information exchange model
[43] between individuals and real world scenario of people
acting based on advice by a consultant.
186 Rajpurohit, Sharma et al.

Coral Reefs Optimization S. Salcedo-Sanz, J. Del Ser, I. Models an artificial coral reef. Member solutions are
Algorithm [44] Landa-Torres, S. Gil-López, and termed as corals that live and reproduce in colonies.
J. A. Portilla-Figueras (2014) Coral choke out other corals for space. This fight
combined with other specific characteristics of corals
form a meta-heuristic computational process.
Covariance Matrix Nikolaus Hansen, Sibylle D. Focuses on reducing the number of generations
Adaptation- Evolution Müller and Petros Koumoutsakos required for convergence. To compensate the reduced
Strategy [45] (2006) number of generations it uses larger population size.
Results in a highly parallel algorithm for distributed
systems with large number of processors.
Crystal Energy X. Feng, M. Ma, and H. Yu Inspired by the features like parallelism, openness,
Optimization Algorithm (2016) local interactivity and self organization of the lake
[46] freezing natural activity.
Cuckoo Search Algorithm Xin-She Yang and Suash Deb Inspired by brood parasitic behavior of some cuckoo
[47] (2009) species and levy flights of some birds and flies.
Cultural Algorithms [48] Robert G. Reynolds (1994) A branch of evolutionary algorithms in which there is
a knowledge component in addition to the population
component. There are different categories of belief
space namely Normative knowledge, Domain specific
knowledge, Situational knowledge, temporal
knowledge and spatial knowledge.
Cuttlefish Algorithm [49] Adel Sabry Eesa, Adnan Mohsin Inspired by the strange property of cuttlefish to change
Abdulazeez Brifcani and Zeynep its skin color. The operator “reflection” simulates the
Orman (2013) reflection mechanism used by the cuttlefish skin while
visibility operator simulates visibility pattern used by
cuttlefish.
D

Dialectic Search [50] S Kadioglu, Meinolf Sellmann Hegel and Fichte’s dialectic search has been
(2009) implemented as a search metaheuristic for constraint
optimization. The mental concept of dialectic has
been implemented for balance in exploitation and
exploration.
Differential Evolution [51] Storn, R.; Price, K. (1997) This is one of the highly used nature inspired
algorithms. Models the reproduction system where
chromosomes exchange information to generate better
off-springs. Models operators like mutation and
crossover.
Differential Search P. Civicioglu (2012) Provides a model to transform geocentric coordinates
Algorithm [52] into geodetic coordinates. The algorithm has been
compared with ABC, JDE, CMA-ES etc. to prove its
superiority in terms of robustness and convergence
speed.
Dolphin Echolocation [53] A. Kaveh, N. Farhoudi (2013) According to some beliefs dolphins are just next to
humans in intelligence. Models the sonar like
echolocation capabilities of dolphins. The algorithm
also uses less number of parameters.
Dolphin Partner Y Shiqin, J Jianjun, Y Guangxing Models the intelligent behavior of dolphins. Simulates
Optimization [54] (2009) their Cluster forming, role recognition,
communication, follow and leadership characteristics.
Uses an operator named nucleus.
Dragonfly Algorithm [55] S. Mirjalili (2016) Exploration and exploitation are inspired by social
behavior of dragonflies while they search food,
navigate and avoid enemies in a swarm. Separate
binary and multi-objective versions of the algorithm
are also designed.
E
Glossary of Evolutionary Algorithms 187

Eagle Strategy [56] X.S. Yang, S. Deb (2010) It is a two stage hybrid search method combining
random search of levy flights with the fire fly
algorithm.
Eco-inspired Evolutionary R.S. Parpinelli, H.S. Lopes (2011) Models several populations and members of each
Algorithm [57] population modify themselves according to the search
strategy and parameter settings. Uses the environment,
relationships and successions of ecology as
inspiration.
Egyptian Vulture Chiranjib Sur, Sanjeev Sharma, Inspired by natural behaviors and key skills of
Optimization [58] and Anupam Shukla (2013) Egyptian vultures when they search for food.
Primarily designed for combinatorial optimization
problems.
Electro-magnetism Erik Cuevas, Diego Oliva , Based on electro-magnetic principle of collective
Optimization [59] Daniel Zaldivar, Marco Pérez- attraction and repulsion to find the optimum solution.
Cisneros, Humberto (2012) Fitness of each member is modeled as charge over the
particle. The algorithm has been implemented for
circle detection problem of digital image processing.
Elephant Gai-Ge Wang, Suash Inspired by herding behavior of elephants. Two
Herding Optimization [60] Deb, Leandro dos S. Coelho elephant herding activities leadership by a matriarch
(2015) and adult male elephants leaving the group are
simulated as two operators namely clan updating
operator and separating operator respectively.
Elephant Search Algorithm Suash Deb, Simon Fong, and Members of population are termed as elephants of a
[61] Zhonghuan Tian (2015) herd. Male members are search agents to explore the
space while female members are local search agents to
exploit the search space locally.
Evolution Strategy [62] Rechenberg & Schwefel (1965) One of the oldest categories of strategies under
evolutionary computational concept. Based on the
basic idea to initialize with a set of values and step by
step changing them slightly with randomness. If the
changed set is better than to keep it otherwise to
discard it and keep the previous one.
Evolutionary Programming David B. Fogel, One of the foundation approaches of most of the
[63] Lawrence J. Fogel (1966) modern evolutionary computing methods. Defined
most of the operations like mutation and crossover.
Implemented it on finite state machine
Exchange Market Algorithm N. Ghorbani, E. Babaei (2014) Based on trading mechanism of shares in the stock
[64] market. Algorithm runs in two modes. The first mode
has oscillations while the second mode does not have
oscillations. At the end of each mode the fitness of all
the members is calculated. These two rounds enable
exploration and exploitation of the search space
respectively. Algorithm uses two searching operators
and two absorbent operators.
F

FIFA World Cup [65] N. Razmjooy, M. Khalilpour, M.

Simulates the competition method followed in sports
Ramezani (2016)
competitions like the soccer world cup of FIFA. It has
a number of parameters that have been formulated in
line of the FIFA world cup.
Firefly Algorithm [66] Xin-She Yang (2009) Mimics the flashing light property of fireflies. Models
the members of population as a set of fireflies where
each firefly gets attracted by another in the magnitude
of its light intensity and mutual distance. Fitness of a
member is denoted as light intensity.
188 Rajpurohit, Sharma et al.

Fireworks Algorithm [67] Y. Tan, Y. Zhu (2010) Simulates the explosion of fire crackers. Two separate
methods for explosion are adopted for maintaining
global and intensive search processes.
Fish-school Search [68] Carmelo J. A. Bastos Fish schools are large groups of fishes that stay
Filho , Fernando B. de Lima Neto, together to increases their chances of survival by
Anthony J. C. C. Lins, Antonio I. mutual cooperation. Derives three operators based
S. Nascimento, Marilia P. Lima upon the behavior of fishes in the fish school namely
(2008) feeding, swimming and breeding.
Flower Pollination Xin-She Yang (2012) Based on the pollination process used for reproduction
Algorithm [69] by plants having flowers. Algorithm uses a model for
pollination where pollinators are used to spread the
pollens over the landscape.
Flying Elephants Algorithm Adilson Elias Xavier, Vinicius The algorithm is a generalization of hyperbolic
[70] Layter Xavier (2016) smoothing approach. Though the algorithm does not
mimic any biological property of elephants and
provides just a method to flight of functions referred
as heavy elephants.
Forest Optimization Manizheh Ghaemi, Mohammad- Algorithm mimics the seeding process of trees in a
Algorithm [71] Reza Feizi-Derakhshi (2014) forest. It models the observation that seeds under the
tree may not grow up while the seeds dispersed away
from the tree itself may grow up as trees.
Fruit Fly Optimization W. T. Pan (2012) Inspired by the behavior of fruit flies. Mainly the
Algorithm [72] algorithm mimics the foraging skills of fruit flies.
G

Galaxy-based Search Hamed Shah-Hosseini (2011) Mimics the spiral arms of spiral galaxies to explore the
Algorithm [73] search space. Chaos is used to get rid of local
optimums. A local search component is also
embedded to balance the result obtained by spiral arm.
Gases Brownian Motion M. Abdechiri, M.R. Meybodi, H. Inspired by Gases Brownian motion and turbulent
Optimization [74] Bahrami (2013) rotational motion. The search method is based upon
the dynamics of gas molecules under pressure.
Gene Expression C. Ferreira (2002) A complete genotype phenotype system in the sense
Programming [75] that it has linear structures of fixed length
chromosomes. All of the operators like mutation,
transposition and recombination results in valid off-
springs.
General Relativity Search Hamzeh Beiranvand, Esmaeel Based on the concept of General Relativity Theory.
Algorithm [76] Rokrok (2015) Members of population are modeled as particles in
space free from all other forces other than gravity. The
particles are then projected to reach the most stable
position. Particles move in geodesic path. Step size
and directions are calculated using velocity and
geodesics.
Genetic Algorithm [77] David E. Goldberg (1989) Foundation for many evolutionary algorithms. It is the
basis for even the older algorithms like DE. Simulated
the natural process of evolution like Selection,
Mutation and Crossover
Glowworm Swarm K. N. Krishnanand and Debasish This method is specifically designed for parallel
Optimization [78] Ghose (2009) searching in multiple optimums of a multimodal
function. The search agents model the glowworms that
possess luminescence called luciferin. Fitness of each
glowworm is encoded as luciferin. Each glowworm
uses a probability function to move towards another
glowworm that has luciferin value higher than its own.
Golden Ball [79] E. Osaba, F. Diaz, E. Onieva Simulated as a soccer game where population is
(2014) divided into multiple teams who search independently
Glossary of Evolutionary Algorithms 189

and compete with each other. This competition

decides about the transfer of solutions among teams.
Good Lattice Swarm Shoubao Su, Jiwen Wang, Good lattice is a random search method based on
Algorithm [80] Wangkang Fan, Xibing Yin number theory using hidden parallel evolutionary
(2007) algorithms and random sampling. Good Lattice
Swarm algorithm is a combination of Good Lattice
and Particle Swarm Optimization to include the
features of both.
Grasshopper Optimisation Shahrzad Saremi, Seyedali Models the optimization problems as swarm of
Algorithm [81] Mirjalili, Andrew Lewis (2017) grasshoppers. Swarming behavior in grasshoppers is
found in both nymph and adulthood. The algorithm
models the larval stage as well as the adult stage.
Young grasshoppers move slowly with small step size
while adult swarms move abruptly with large step size.
Gravitational Search B. Webster and P.J. Bernhard The algorithm starts searching at an arbitrary point and
Algorithm [82] (2003) keeps repairing the solution repeatedly by modifying
some of its search agents. For repairing process is
inspired by the motion of a mass under influence of
gravitational force applied by other bodies.
Great Deluge Algorithm G. Dueck (1993) It is an algorithm with only one parameter. Initially
(and Record-to-record one set of values is chosen then each step slightly
Travel) [83] changes the values and fitness is compared with the
previous one. If the new fitness value is better than the
new set of values is treated as the old values.
Great Salmon Run [84] A. Mozaffari, A. Fathi, S. The Great Salmon Run is a natural annual event in
Behzadipour (2012) which millions of salmon fishes return from pacific
ocean to the streams of North America where they
were born. Grizzly bears of North America also
depend upon this event for their survival. The
algorithm simulates this event as a population based
optimization method.
Greedy Politics J.M.L. Melvix (2014) Inspired by the methods adopted by the politicians to
Optimization [85] win elections and form government. Surprisingly, the
algorithms works better when the parameters related
to unfair means used by the politicians are set.
Grenade Explosion Method Ali Ahrari and Ali A. Atai (2010) Modeled like the way of explosion of a grenade. Uses
[86] the concept that the shrapnel damage the locality of the
explosion. Loss caused by each shrapnel is calculated
and next grenade is targeted at the place maximum
damage occurred in the previous explosion.
Grey Wolf Optimizer [87] Seyedali Mirjalili, Seyed Inspired by the hierarchical leadership approach and
Mohammad Mirjalili, and hunting methods of grey wolves. It has implemented
Andrew Lewis (2014) three main methods of hunting strategies of grey
wolves namely searching, encircling and attacking.
Group Counseling M.A. Eita and M. M. Fahmy Emulates the problem solving behavior of humans by
Optimization [88] (2010) counseling. The iterations of the algorithm are termed
as counseling sessions where members improve their
positions by either self or group counseling.
Group Search Optimizer S. He, Q.H. Wu, J.R. Saunders Mimics the group searching behavior shown by many
[89] (2009) animals. Based on producer-scrounger model where
animals search either for new food source (producer)
or an already engaged food source (scrounger).
H

Harmony Search [90] Zong Woo Geem, Joong Hoon Harmony is a relationship between various sound
Kim, and G. V. Loganathan waves of different frequencies. Best harmony is the
(2001) one which provides best aesthetic experience to the
190 Rajpurohit, Sharma et al.

listener. The algorithm draws similarity between

finding harmony in a musical performance and finding
the optimum solution to an optimization problem.
Heart [91] Abdolreza Hatamlou (2014) The algorithm models the optimization problem as
heart and circulatory system. The member of the
population with best fitness is termed as heart and
other members are called blood molecules. The blood
molecules are moved towards or away the heart to
search for a better fitness point.
Hierarchical Swarm Model Hanning Chen, Yunlong The model suggests a hierarchical approach for swarm
[92] Zhu, Kunyuan Hu and Xiaoxian based optimization algorithms. It suggests that an
He (2010) agent in the higher level of hierarchy may be
composed of a swarm of lower level agents and
different swarms from different levels evolve on
different scales.
Honey-bees Mating H.A. Abbass (2001) Honey bees exhibit special characteristics in terms of
Optimization Algorithm communication, cooperation and division of work.
[93] The algorithm simulates marriage in honey bees. It
simulates a bee colony with a single bee without a
family and evolves in a colony of one or more queens
with family.
Hoopoe Heuristic Mohammed El-Dosuky, Ahmed Search agents are termed as hoopoes (a bird). Only one
Optimization [94] El-Bassiouny, Taher Hamza, and hoopoe is allowed to explore the landscape using Levy
Magdy Rashad (2012) flights. The hoopoes penetrate the landscape by
digging a bill to look for food such as insects. If the
search results are good then the neighborhood of the
current dig is to be explored.
Human-inspired Algorithm L.M. Zhang, C. Dahlmann, Y. The algorithm mimics the search methods adopted by
[95] Zhang (2009) mountaineers to find the highest mountain peak using
modern facilities like binoculars and phones. The
unique feature of the method is that it divides the
search space into equal subspaces and deploys equal
number of search agents in each subspace.
Hunting Search [96] R. Oftadeh , M. J. Mahjoob Mimics the hunting behaviors of animals like lions,
(2009) wolves and dolphins. Algorithm imitate the hunting
method in which the hunting animals search for prey
in a group, encircle it and gradually tighten the
encircling ending up to catch the prey.
I

Imperialist Competitive Esmaeil Atashpaz-Gargari and The members of population are termed as countries.
Algorithm [97] Caro Lucas (2007) Initial population of countries is divided into two parts
imperialists and colonies forming several empires.
During the iterations, weak empires fall and strong
ones take control of their colonies. Convergence is the
state in which there is only one empire and all the
colonies have the fitness similar to it.
Intelligent Water Drops Hamed Shah-Hosseini (2009) The algorithm is based upon the property of rivers to
Algorithm [98] find out optimum path between source and destination.
It models the action and reaction between water drops
and river bed. Intelligent water drops are the search
agents that cooperate to find out optimum solution.
Interior Design and A.H. Gandomi (2014) An optimization method inspired by interior design
Decoration [99] and decoration. Constitute two search methods namely
composition optimization and mirror search. Three
different strategies are introduced for tuning the only
parameter for the algorithm.
Glossary of Evolutionary Algorithms 191

Invasive Tumor Growth D Tang, S Dong, Y Jiang, H Li, Y Based on the growth mechanism of an invasive tumor.
Optimization Algorithm Huang, (2015) In an invasive tumor each cell fights for nutrient for its
[100] survival and growth. For the working of the algorithm,
the cells are divided into three categories namely
proliferative cells quiescent cells and dying cells. Then
the cells move in the space to improve their fitness.
This movement depends upon chemotaxis, random
walk and communication among cells
Invasive Weed Optimization A.R. Mehrabian, C. Lucas (2006) The algorithm is inspired by weed colonies. Weed
[101] colonies are vigorous in growth and poses a threat to
the desirable plants. Weeds are also adaptable to
environmental changes. The properties of robustness,
randomness and adaptation are modeled as a
numerical optimization method.
Ions Motion Algorithm B. Javidy, A. Hatamlou, S. The algorithm is inspired by natural phenomenon of
[102] Mirjalili (2015) motion of ions. Simulates the attraction and repulsion
of anions and cations. Population is divided into two
sets of positive and negative ions. Ions are relocated in
the search space based on the principle that ions with
opposite charge attract each other and with same
charge repel each other.
J

Jaguar Algorithm with Chin-Chi Chen, Yung-Che Tsai, Inspired by the hunting behavior of jaguars. Once a
Learning Behavior [103] I-I Liu, Chia-Chun Lai, Yi-Ting jaguar identifies its prey it moves swiftly and directly
Yeh, Shu-Yu Kuo, Yao-Hsin to the target. Jaguars also use to hunt as teams.
Chou (2015) Algorithm mimics the hunting characteristics of jaguar
to balance the exploitation and exploration of the
search.
Japanese Tree Frogs Calling H. Hernández, C. Blum (2012) Based on calling behavior of Japanese tree frogs. Male
[104] frogs call to attract the females. Different groups of
male frogs located in the same area avoid calling at the
same time to try and make the female frogs able to
locate them. The algorithm uses this
desynchronization approach for graph coloring
K

Kaizen Programming [105] V. V. Melo (2014) Kaizen is a Japanese approach of problem solving.
Unlike other evolutionary approaches where each
agent is a complete solution, in this approach, each
expert suggests an idea to solve the problem and the
final solution is composed of all the ideas put together.
Each idea’s fitness is measured by its contribution to
the final solution.
Keshtel Algorithm [106] M. Hajiaghaei-Keshteli, M. Keshtel algorithm has been used for mathematical
Aminnayeri (2014) modeling of the assembly line and transportation
scheduling problem. Performance improvement has
been done using the Taguchi approach. In addition,
Genetic Algorithm has also been implemented.
Krill Herd [107] Amir Hossein Gandomi and Amir Based on the herding behavior of krill. Members of
Hossein Alavi (2012) population are modeled as krill individuals of a herd.
Objective function for each individual’s movement
depends upon its distance from the food and from the
highest density of the herd. The movement is also
affected by presence of other members, foraging and
randomness.
L
192 Rajpurohit, Sharma et al.

League Championship Ali Husseinzadeh Kashan (2009) Based on the competition of teams in a sports league.
Algorithm [108] Search agents are termed as teams who compete for
several weeks (iterations). This competition is in pairs
and the winner is one with better fitness value. At the
end of each iteration, all the teams apply necessary
changes and prepare for the next week.
Lightning Search Algorithm H. Shareef, A.A. Ibrahim, A.H. Inspired by the natural phenomenon of lightening. A
[109] Mutlag (2015) concept of projectiles is used to update population.
Three types of projectiles are used namely step leader
projectile, space projectile and lead projectile. The
exploration of the search space is performed using
exponential random behavior of space projectiles.
Lion Optimization Maziar Yazdani and Fariborz Motivated by social and cooperative behavior of lions.
Algorithm [110] Jolai (2016) Lions reside in two categories residents and nomads.
A pride consists of around five female lions and their
cubs of both genders called residents. Adult male lions
leave the pride and move freely. Residents are
modeled as agent for local intensive search while
nomads represent agents to explore search space.
Locust Swarms [111] Stephen Chen (2009) Inspired by locust swarms, the algorithm starts with
smart initial points. Then it uses PSO and a greedy
local search method to explore the search space. The
scouts (search agents) start with a minimum distance
from previous optimum.
M

Magnetotactic Bacteria Hongwei Mo and Lifang Xu Magnetotactic bacteria (MTB) have developed a
Optimization Algorithm (2013) capability to orient and swim along the geomagnetic
[112] field. The concept of the algorithm is that only the
MTBs with magnetosomes which can divert the
magnetic field to minimize their magnetic energy can
survive. MTBs need to maximize their swimming
efficiency to find optimum oxygen levels and survive.
Migrating Birds Ekrem Duman, Based on the “V” formation used by birds to minimize
Optimization [113] Mitat Uysal, energy when they migrate. Birds need to maintain the
Ali Fuat Alkaya (2011) air pressure above their wings lower than the air
pressure below their wings. The V formation helps
them reduce the energy required to maintain this air
pressure constraint.
Mine Blast Algorithm [114] Ali Sadollah, Ardeshir Based on the real world event of a mine blast. A
Bahreininejad, Hadi Eskandar, number of shrapnel are spread in an explosion. Each
Mohd Hamdi (2012) piece of shrapnel may trigger a new blast. The shrapnel
piece that created the maximum damage is selected to
explode the new mine.
Monarch Butterfly G. Wang, S. Deb, Z. Cui (2015) Modeled on the migration of monarch butterflies from
Optimization [115] North America and South Canada Mexico in the
summers. Initially all the butterflies (search agents)
are situated in one of the two land i.e. North America
and Mexico. Then, migration operator generates new
off-springs which are updated using migration ratio.
Monkey Search [116] Antonio Mucherino and Onur Mimics the way monkeys climb trees in search of
Seref (2007) food. Tree branches represent perturbations between
two probable food sources. Monkeys as search agents
mark and later update these branches when they climb
the tree up and down.
Moth-flame Optimization Seyedali Mirjalili (2015) Inspired by the travel methods of moths. Moths use to
Algorithm [117] fly at night keeping a fixed angle with the moon to
travel in straight line for long distances. Local optima
Glossary of Evolutionary Algorithms 193

are modeled as artificial lights that trap the moths in

useless spiral distractions.
Multi-verse Optimizer [118] S. Mirjalili, S. M. Mirjalili, A. Based upon three major theories of Cosmology
Hatamlou (2015) namely Black hole, White hole and Warm hole. All
three have been mathematically modeled to perform
exploration, exploitation and local search respectively.
O

Optics Inspired A.H. Kashan (2015) A concave mirror converges the incident light rays
Optimization [119] where as a convex mirror scatters the light. The optical
phenomenon has been modeled as an optimizer. The
algorithm treats the surface of the search space as a
reflecting mirror in which each peak works as convex
mirror and each valley works as a concave mirror.
P

Paddy Field Algorithm U. Premaratne, J. Samarabandu, The algorithm starts with scattering the seeds (search
[120] T. Sidhu (2009) agents) randomly. After that the number of seeds
generated by each plant depends upon the fitness
value. The plant with better fitness will produce more
seeds. Further, seeds with better fitness only will be
allowed to grow. All plants dissipate seeds to
overcome local optimum.
Parliamentary Optimization A. Borji (2007) Simulates the intra and inter group competitions
Algorithm [121] similar to those used in a parliament. All members are
divided into some groups randomly. Members of a
party belong to either regular or candidate category. A
candidate is chosen as the leader of the group who
competes with the leaders of other groups in the next
round.
Particle Swarm R. Eberhart, J. Kennedy (1995) One of the most popular metaheuristic. Each search
Optimization [122] agent (particle) keeps information about the best
position it has gained so far. The global best value is
also kept track of. In each step a particle is moved
towards the best particle with a changed velocity and
added randomness.
Pattern Search [123] R. Hooke, T. A. Jeeves (1961) It is a class of optimization methods derived from the
approach introduced by Hooke and Jeeves in 1961.
This category of methods need only to return the value
of f(x) for some point x. It was also called direct search
or black box search. It performs local and global
search by its two steps namely Exploratory Search and
Pattern Move.
Penguins Search Y. Gheraibia, A. Moussaoui Based upon the cooperative behavior of penguins
Optimization Algorithm (2013) shown while they hunt. Each penguin starts search
[124] process from its own locality and inform about its
position and fishes found to the other members of the
group. The global best is selected by identifying the
group that hunted most fishes.
Photosynthetic Learning Haruhiko Murase, Akira Wadano Uses the Benson-Calvin cycle which governs the
Algorithm [125] (1998) conversion of carbon molecules from one substance to
another during the process of photosynthesis in pants.
The algorithm has been implemented to solve
Travelling Salesman Problem.
Plant Growth Optimisation Wei Cai, Weiwei Yang and Inspired by plant growth process, the algorithm
[126] Xiaoqian Chen (2008) proposes an artificial plant growth model. Specific
194 Rajpurohit, Sharma et al.

operators include leaf growth, branching,

phototropism and spatial occupancy.
Plant Propagation Abdellah Salhi, Eric S Fraga It is based on the observation that plants scatter their
Algorithm [127] (2011) runners in the areas full of nutrients and light. If such
good spot is away from its location it sends long
runners and if the plant itself is at a good spot it will
send short runners in high concentration.
POPMUSIC: Partial Éric D. Taillard, Stefan Voss The methodology is to divide a problem into subparts
Optimization Metaheuristic (2001) and iteratively optimize each of them locally. Thus the
Under Special global solution found will also be optimized. The
Intensification Conditions algorithm can be seen as a local optimizer working in
[128] a large neighborhood.
Q

Queen-bee Evolution [129] S.H. Jung (2003) Based on the concept that only the queen bee is the
parent of most of the bees in a bee colony. In the
algorithm, the fittest bee crossbreeds with other bees
selected by the algorithm. Though this increases the
exploitation but at the same time increase the chances
of trapping into local optima. To avoid this, few
members of population undergo strong mutation.
R

Raven Roosting  Anthony Brabazon, Wei Cui, Inspired by the social roosting behavior of raven (a
Optimization Algorithm Michael O’Neill (2014) bird). A number of species specially birds display the
[130] behavior of social roosting. These social roosts work
as centers for information exchange among the
members about food sources and nearby threats.
Ray Optimization [131] A. Kaveh and M. Khayatazad Models the refraction property of light rays. Search
(2012) agents are termed as rays. When the ray travels from
lighter medium to denser or vice versa its direction
changes. This change in the direction enables to
explore in the early stage of the algorithm and later to
converge.
Reincarnation [132] A. Sharma (2010) Inspired by the religious belief of rebirth of a human
soul with a different biological entity. All the humans
(search agents) are divided into two categories namely
gurus and commoners. Gurus are the ones having
higher fitness value. All the humans may be upgraded
or degraded depending upon their deeds. All the
commoners get influenced by their gurus.
River Formation Dynamics P. Rabanal, I. Rodrí
guez, F. Designed to solve travelling salesman problem in
[133] Rubio (2007) general. Improves the shortcomings of Ant Colony
Optimization. Nodes are assigned altitude values.
Drops either increase or decrease the altitudes of the
edges as they move. Probability of a drop to take an
edge depends upon the slope of the edge.
Roach Infestation Timothy C. Havens, Christopher Mimics the collective and individual behavior of
Optimization [134] J. Spain, Nathan G. Salmon and cockroaches. Cockroaches try to search the darkest
James M. Keller (2008) place; fitness of a cockroach is proportional to the
darkness of its location. They communicate with each
other with a predefined probability. At a certain point
in time, cockroaches leave the comfortable darkness
and search for food.
Root Growth Optimizer Xiaoxian Hea , Shigeng Zhang , Inspired by the growth mechanisms of plant roots,
[135] Jie Wang (2015) mainly self-similar propagation and optimization of
continuous space search. Also models the concept that
Glossary of Evolutionary Algorithms 195

different roots adopt different strategies according to

their roles.
Rooted Tree Optimization Yacine Labbi, Djilani Ben Attous, Mimics the growth process of plant roots. The
Algorithm [136] Hossam A. Gabbar, Belkacem optimized solution is modeled as wet soil and the roots
Mahdad, Aboelsood Zidan (2016) grow in the direction of wet soil. One root grows in the
direction of current best soil, another in the direction
of previous best soil and one more root grows in a
random direction to search a new wet place.

Runner-root Algorithm F. Merrikh-Bayat (2015)

Models the purpose of runners and roots of plants.
[137]
Runners help them search in a wide area with large
steps while roots assist in search in nearby small area.
Similarly, the algorithm has two functions matching
the runners and roots for exploration and exploitation
respectively.
S

Saplings Growing Up Ali Karci, Bilal Alatas (2006) Inspired by sowing and growing up of saplings. The
Algorithm [138] algorithm contains two phases: sowing phase and
growing-up phase. Uniform sowing aims to evenly
distribute the search agents in the space. Growing up
phase contains three operators: mating, branching and
vaccinating.
Scatter Search [139] F. Glover(1977) Different from other evolutionary algorithms because
it is based on the concept of systematic methods to
create new solutions that yields several benefits over
randomization. Uses systematic methods for
diversification and intensification of the search
process.
Scientific Algorithms for D. Felipe, E. Goldbarg, and M. Mimics the methodology of scientific research. Uses
the Car Renter Salesman Goldbarg (2014) the idea of theme to search the space. Steps of research
Problem [140] that imitates the blocks of the algorithm are thinking,
knowledge sharing and disclosing ideas.
Seven-spot Ladybird Peng Wang, Zhouquan Zhu, and Based on the foraging behavior of the seven-spot
Optimization [141] Shuai Huang (2013) ladybird (an insect). Whole search space is divided
into equal subspaces in each dimension called patches.
Each seven-spot ladybird improves its fitness by
moving towards either the best in the patch or the
global best.
Shark Smell Optimization Oveis Abedinia, Nima Amjady, Sharks are one of the cleverest hunters. The algorithm
[142] and Ali Ghasemi (2014) is inspired by the smelling capabilities of the shark.
The mathematical steps of the algorithm imitate the
intelligent behavior of shark used by it to find the
source of smell in the oceanic environment.
Sheep Flocks Heredity Hyunchul Kim and Byungchul Mimics sheep flocks. Based on the concept that sheep
Model [143] Ahn (2001) generally live and reproduce within their flock
allowing the biological inheritance from within a flock
only. But occasionally, sheep from different flocks
meet to reproduce and propagate better qualities.
Shuffled Frog Leaping Eusuff and K.E. Lansey (2003) Mimics the cooperative behavior of frogs displayed
Algorithm [144] while they search for food in a swamp. Frogs are
distributed into few groups. Each frog moves towards
either the best frog of the group or the global best frog.
At the end of each iteration, all the groups are merged
and distributed again.
Simplex Heuristic [145] J.P. Pedroso (2007) An extension of Nelder and Mead simplex algorithm
which is applicable for non-linear problems also. A
196 Rajpurohit, Sharma et al.

number of methods are suggested to jump out from the

local optima. Uses large simplex at initialization and
large moves initially.
Simulated Annealing [146] S. Kirkpatrick, D. Gelatt Jr., and Inspired by the heating and cooling of metals.
M. P. Vecchi, (1983) “Temperature” is the most important parameter of the
algorithm. It is usually decreased by some predefined
factor at the end of each iteration.
Small-world Optimization H Du, X Wu, J Zhuang (2006) Based on some scientific experiments performed by
Algorithm [147] psychologists on the communication and networking
methods of human beings. Uses “local short-range
searching operator” and “random long-range
searching operator” for local and global searching
respectively.
Soccer Game Optimization H.D. Purnomo, H.-M. Wee The algorithm combines information sharing and
[148] (2012) evolution operators from swarm intelligence and
evolutionary algorithms respectively. Move off and
move forward activities of a soccer player are used to
describe the steps of the algorithm.
Social Cognitive Xiao-Feng Xie, Wen-Jun Zhang, Based on the knowledge and intelligence development
Optimization [149] Zhi-Lian Yang (2002) in humans. Utilizes the belief that humans learn by
observing others and by looking the outcome of
others’ efforts. Takes personal, behavioral and
environmental factors into account.
Social Emotional Y. Xu, Z. Cui, J. Zeng (2010) Emulates the efforts by human beings to acquire
Optimization [150] higher social status. Members of population are
termed as human beings living in a society. Each
member tries to increase its emotional index. Based on
this emotional index and the feedback from the other
members of society, social status keeps updating. At
the end, the individual with highest social status is the
optimum solution.
Social Spider Algorithm Erik Cuevas, Emulates the cooperative behavior of individual
[151] Miguel Cienfuegos, spiders in a colony. The search agents are termed as
Daniel Zaldívar , spiders. There are two categories of spiders; male and
Marco Pérez-Cisneros (2013) female. Both of them have separate rules to update
their position and communicate depending upon the
Society and Civilization Ray, Tapabrata, and Kim Meow Based on the concept that social communication plays
[152] Liew (2003) an important role in development of species along with
the biological evolution. Simulates intra-society and
inter society communications.
Sperm Motility Algorithm Raouf, Hezam (2017) Based on the human reproduction system. The search
[153] agents (sperms) are randomly distributed in the search
space. Random movement of the sperm in search of
the ovum has been modeled using Stokes equations. A
chemical secreted from the ovum attracts the sperms
towards the optimum solution.
Sperm Whale Algorithm A. Ebrahimi, E. Khamehchi Sperm whale is the largest toothed predator. It has
[154] (2016) many unique features evolved to survive and develop
the oceanic conditions. The most outstanding feature
of the algorithm is that it uses best as well as worst
point to reach to global optima.
Spider Monkey Jagdish Chand Bansal, Inspired by the foraging behavior of spider monkeys.
Optimization [155] Harish Sharma, Spider monkeys follow fission-fusion based social
Shimpi Singh Jadon, structure. They alter the size of groups from smaller to
Maurice Clerc (2014) larger or vice-versa depending upon the quantity of
food available.
Spiral Dynamics Inspired K. Tamura, K. Yasuda (2011) Inspired by the spiral phenomenon frequently found in
Optimization [156] nature. Many natural constructs like galaxies,
Glossary of Evolutionary Algorithms 197

cyclones, whirlpools observe such motion. The

algorithm uses multidimensional spiral to search the
space. There are control parameters to balance
diversification and intensification.
Stochastic Diffusion Search Bishop, J.M. (1989) Based on “The Restaurant Game” in which a group of
[157] delegates in a new town search for the best restaurant
to dine. In the algorithm, a member shares its fitness
with another member via direct one-to-one
communication and the better one is selected. In the
end, a cluster wise best solution is available.
Stochastic Fractal Search H. Salimi. (2015) Imitates the natural phenomenon of growth called
[158] fractal. Each particle is assumed to possess an electric
charge. Then this particle diffuses and few new
particles are created. The charge is divided among
these child particles. Unfit particles keep being
discarded in each generation.
Strawberry Algorithm [159] F. Merrikh-Bayat (2014) Inspired by the functioning of runners and roots of
strawberry plant. Runners mimic the exploration while
roots mimic local search. The algorithm is different
from others in the sense of duplicate elimination, both
small and large step sizes for all agents and lack of
communication between agents.
Swallow Swarm Mehdi Neshat, Ghodrat Sepidnam Imitates the movement and other cooperative
Optimization Algorithm (2013) behaviors of swallow swarms. The particles are
[160] divided into three categories namely explorer, aimless
and leader. Influence of neighbor, local leader and
global leader is modeled while moving in the search
space.
Symbiotic Organisms M.Y. Cheng, D. Prayogo, (2014) Mimics the symbiotic cooperation methods adopted
Search [161] by two distinct species to survive in the nature. This
cooperation may be obligate or facultative. The
algorithm iteratively performs Mutualism,
communism and parasitism phases representing the
types of symbiotic relationships.
T

Tabu Search [162] Fred Glover (1986) An extension of local search used in mathematical
optimization. The algorithm enhances the local search
by modifying its basic rule. The first modification is:
at each step a worse solution is also acceptable if no
better solution is found. Second: discouragement to
search at a previously visited location.
Teaching-learning based R. V. Rao, V. J. Savsani, D. P. Based on the teacher-learner relationship. Members of
Optimization [163] Vakharia (2011) population are termed as a class of learners. Search
process consists of two phases. In the first phase
learning is done by teacher’s influence while, in the
second phase learners learn by mutual interaction.
Termite Colony Optimization Ramin Hedayatzadeh, Foad Inspired by the methods used by termites to adjust
[164] Akhavan Salmassi, Reza Akbari, their search paths. Although termites move randomly
Koorush Ziarati (2010) in the search space but their search trajectories are
influenced by directions of more pheromones.
V

Viral Systems [165] Cortés P., García J.M., Muñuzuri Designed for combinatorial optimization. Mimics the
J. and Onieva L0 (2008) specific features of viruses like replication and
infection of the host environment. Application has
been shown on series of Steiner problem.
198 Rajpurohit, Sharma et al.

Virus Colony Search [166] Mu Dong Li, Hui Zhao, Xing Wei Virus colony or viral plaque is a structure formed in a
Weng, Tong Han (2016) cell structure such as bacterial colony. They can be
detected visually using colony counters. Like other
virus based algorithms, this algorithm also simulates
the diffusion and propagation strategies adopted by
viruses to infect the host.
Virus Optimization Chia Liang, Josue Rodolfo Imitates the virus infection of a living cell. To model
Algorithm [167] Cuevas Juarez (2016) exploration and exploitation, the algorithm defines
two categories of viruses as strong and common
viruses. Interaction is allowed between only those
viruses that can co-exist.
Vortex Search Algorithm B. Dogan, T. Olmez (2015) A single solution based metaheuristic. Inspired by the
[168] vertical flow pattern of fluids. To balance the
exploitation and exploration of the search, the
algorithm uses the scheme of adaptive step size.
W

Wasp Swarm Optimization P Pinto, TA Runkler, JM Sousa Imitates the social behavior of wasps that they exhibit
[169] (2005) while foraging and caring of their broods. Using
cooperation, wasps efficiently manage all the tasks
without any predefined planning. They do have a
hierarchy of members within a colony. The algorithm
has been designed specifically with reference to
logistics system optimization.
Water Cycle Algorithm Hadi Eskandar, Ali Sadollah, Imitates the natural process of water cycle. Rains bring
[170] Ardeshir Bahreininejad, Mohd water to surface and rivers take it back to the oceans.
Hamdi, (2012) Specifically, it models how rivers and streams link and
proceed towards sea.
Water Evaporation A. Kaveh and T. Bakhshpoori The algorithm is based on the evaporative properties
Optimization [171] (2016) of water molecules from solid surfaces with different
wettabilities. Water molecules are considered as
members of population and the solid surface as search
space. Wettability of the surface along with other
molecular properties is coded as different search
parameters.
Water Wave Optimisation Y.J. Zheng (2015) Based on the shallow water wave theory. Various
[172] operators like propagation, refraction and breaking
have been implemented inspired by the phenomena of
water flow.
Water-flow Algorithm [173] Trung Hieu Tran, Kien Ming Ng The algorithm is inspired by hydrological cycle and
(2011) natural phenomenon of erosion. The erosion capacity
has been made scalable by using variable precipitation
and falling force. This helps in guiding the search
towards promising region.
Whale Optimization Seyedali Mirjalili and Andrew Inspired by the social behavior of humpback whales.
Algorithm [174] Lewisa (2016) The algorithm consists of three steps, each inspired by
the habitual behaviors of whales. These steps are
Encircling prey, Bubble-net attacking method
(Exploitation step) and Search for prey (Exploration
step).
Wind Driven Optimization Zikri Bayraktar, Muge Komurcu, Imitates the natural phenomenon of wind in which it
[175] and Douglas H. Werner (2010) blows from higher to lower pressure. Models various
factors that affect the motion of wind like air pressure,
friction, gravitational force and coriolis force (caused
by the rotation of the earth).
Wolf Search Algorithm Rui Tang, S. Fong, Xin-She Inspired by the way wolves search for food and
[176] Yang, and S. Deb (2012) survive the dangers around their habitat. Each agent
searches independently and keeps its previous
Glossary of Evolutionary Algorithms 199

positions in its memory. It merges with any other agent

only when it finds it better than all of its previously
visited points.
Worm Optimization [177] J.P. Arnaout (2014) Mimics the unique biological features of
Caenorhabditis elegan, a nematode having only 302
neurons. Mimics its various properties like searching
food, avoiding toxins, foraging, balance between
searching and dwelling food etc. Has been
successfully applied on Travelling Salesman problem.

Zombie Survival Hoang Thanh Nguyen, Bir Bhanu Based on the hypothetical foraging behavior of
Optimization [178] (2012) zombies. Models the optimization problem in an
environment where zombies search for an air born
antidote which can cure and turn zombies back into
humans. Defines three modes for search agents
namely exploration mode, human mode and hunter
mode.

Computing and Applications, 24(7), pp 1867–

III. Conclusion 1877, 2014
This paper is an attempt to provide the list of concepts that are [7] A. Colorni, M. Dorigo, V. Maniezzo. “Distributed
basis for many metaheuristic algorithms. Considering the Optimization by Ant Colonies”, In the
length of the list, it was not possible to provide detail working proceedings of the First European Conference on
of these algorithms. Thus we have focused on outlining the Artificial Life, Paris, France, Elsevier Publishing,
core source of inspiration only. The glossary may amaze 134-142, , 1991
young researchers and motivate them to explore their [8] S. Mirjalili. "The ant lion optimizer", Advances in
surroundings, find out their source of inspiration and use it to Engineering Software, 83, pp 80-98, 2015
develop new and more efficient metaheuristics. [9] S. U. Ali, G. Tezel, E. Yel. “Artificial algae
algorithm(AAA) for nonlinear global
References optimization”, Applied Soft Computing, 31, pp
153-157, 2013
[1] F. Campelo, C. Aranha, R. Koot. “Evoltionary [10] D. Karaboga, B. Basturk. “A powerful and
Computation Bestiary”, Web blog, as on June 25, efficient algorithm for numerical function
2017, URL: www. github.com/fcampelo/EC- optimization: artificial bee colony (ABC)
Bestiary algorithm”, Journal of Global Optimization,
[2] S. Akyol, B. Alatas. “Plant Intelligence based 39(3) pp 459–471, 2007
Metaheuristic Optimization Algorithms”, [11] B. Alatas. “ACROA: Artificial Chemical Reaction
Artificial Intelligence Review, 47(4), pp. 417-462, Optimization Algorithm for global optimization”,
2017 Expert Systems with Applications, 38(10), pp
[3] J. B. Odili, M. N. M. Kahar. "Solving the Traveling 13170–13180, 2011
Salesman's Problem Using the African Buffalo [12] P. Civicioglu. “Artificial cooperative search
Optimization". Computational intelligence and algorithm for numerical optimization problems”,
neuroscience, vol. 2016, Article ID 1510256, 12 Information Sciences, 229, pp 58–76, 2013
pages, 2016 [13] M. T. Adham, P. J. Bentley. “An Artificial
[4] C. Subramanian, A. S. S. Sekar, K. Subramanian. Ecosystem Algorithm applied to static and
"A New Engineering Optimization Method: Dynamic Travelling Salesman Problems”, In
African Wild Dog Algorithm", International Proceedings of the IEEE International Conference
Journal of Soft Computing, 8(3), pp 163-170, 2013 on Evolvable Systems, Orlando, FL, USA, pp 149-
[5] H. Shayeghi, J. Dadashpour. “Anarchic Society 156, 2014
Optimization Based PID Control of an Automatic [14] X. L. Li, Z. J. Shao, J. X. Qian. “An optimizing
Voltage Regulator (AVR) System”, Electrical and method based on autonomous animals: Fish-swarm
Electronic Engineering, 2(4),pp. 199-207, 2012 Algorithm,” System Engineering Theory and
[6] X. X. Li, J. Zhang, M. Yin. “Animal migration Practice, vol. 22(11), pp.32-38, 2002
optimization: an optimization algorithm inspired
by animal migration behavior”, Neural
200 Rajpurohit, Sharma et al.

[15] ] J. Li, Z. Cui, Z. Shi. "An improved artificial plant Swarm and Evolutionary Computation, 10, pp 1-11,
optimization algorithm for coverage problem in 2013
WSN", Sensor Letters, 10(8), pp 1874-1878, 2012 [31] Y. Shi. "An optimization algorithm based on
[16] T. Chen. “A simulative bionic intelligent brainstorming process", Emerging Research on
optimization algorithm: Artificial searching swarm Swarm Intelligence and Algorithm Optimization,
algorithm and its performance analysis”. In pp 1-35, 2015
Proceedings of the IEEE International Joint [32] Oguz FINDIK. “Bull optimization algorithm based
Conference on Computational Sciences and on genetic operators for continuous optimization
Optimization, CSO 2009, Vol. 2, pp 864-866, 2009 problems”, Turkish Journal of Electrical
[17] G. W. Yan, Z. J. Hao. "A novel optimization Engineering & Computer Sciences, 23, pp 2225-
algorithm based on atmosphere clouds model", 2239, 2015
International Journal of Computational [33] F. Comellas, J. MartinezNavarro. "Bumblebees: a
Intelligence and Applications, 12(01), p.1350002, multiagent combinatorial optimization algorithm
2013 inspired by social insect behaviour", In
[18] P. Civicioglu. “Backtracking Search Optimization Proceedings of the first ACM/SIGEVO Summit on
Algorithm for numerical optimization problems”, Genetic and Evolutionary Computation, Shanghai,
Applied Mathematics and Computation, 29(15), pp. China, pp 811-814, 2009
8121-8144, 2013 [34] M. K. Ibrahim, R. S. Ali. "Novel Optimization
[19] S.D. Muller, J. Marchetto, S. Airaghi, P. Algorithm Inspired by Camel Traveling Behavior",
Kournoutsakos. “Optimization based on bacterial Iraq J. Electrical and Electronic Engineering,
chemotaxis”, IEEE Transactions on Evolutionary 12(2), 167-178, 2016
Computation, 6(1), pp 16-29, 2002 [35] Shu-Chuan Chu, Pei-Wei Tsai, Jeng-Shyang Pan.
[20] B.Niu, H. Wang. “Bacterial Colony Optimization”, “Cat Swarm Optimisation”, In Proceedings of the
Discrete Dynamics in Nature and Society, 2012 9th Pacific Rim International Conference on
[21] S. Das, A. Chowdhury, A. Abraham. “A Bacterial Artificial Intelligence, Guilin, China, pp 854-858,
Evolutionary Algorithm for automatic data 2006
clustering”, In Proceedings of IEEE Congress on [36] R. A. Formato. "Central force optimization: a new
Evolutionary Computation, Trondheim, Norway, metaheuristic with applications in applied
pp 2403-2410, 2009 electromagnetics", Progress In Electromagnetics
[22] K.M. Passino. "Biomimicry of bacterial foraging Research, 77, 425-491, 2007
for distributed optimization and control", IEEE [37] A. Kaveh, S. Talatahari. "A novel heuristic
control systems, 22(3), pp 52-67, 2002 optimization method: charged system search", Acta
[23] Y. Chu, H. Mi, H. Liao. “A Fast Bacterial Mechanica, 213(3-4), pp 267-289, 2010
Swarming Algorithm for high-dimensional [38] X. Meng, Y. Liu, X. Gao, H. Zhang. “A New
function optimization”, In Proceedings of IEEE Bio-inspired Algorithm: Chicken Swarm
World Congress on Computational Intelligence, Optimization”, In Proceedings of ICSI 2014, vol
Hong Kong, pp 3135-3140, 2008 8794, pp 86-94, 2014
[24] Xin-She Yang. "A new metaheuristic bat-inspired [39] L.N. de Castro, F.J. von Zuben. "The clonal
algorithm", In Proceedings of the Fourth selection algorithm with engineering applications",
International Workshop on Nature inspired In Proceedings of the Genetic and Evolutionary
cooperative strategies for optimization (NICSO Computation Conference, Las Vegas,
2010), Berlin, Heidelberg, pp 65-74, 2010 Nevada, USA, pp 36-39, 2000
[25] O. K. Erol, I. Eksin. "A new optimization method: [40] ] I. C. Obagbuwa, A. O. Adewumi. "An Improved
big bang–big crunch", Advances in Engineering Cockroach Swarm Optimization", The Scientific
Software, 37(2), pp 106-111, 2006 World Journal, 2014
[26] D. Simon. "Biogeography-based optimization", [41] A. Kaveh, V. R. Mahdavi. "Colliding bodies
IEEE Transactions on Evolutionary Computation, optimization: a novel meta-heuristic method",
12(6), pp 702-713, 2008 Computers & Structures, 139, pp 18-27, 2014
[27] A. Askarzadeh. "Bird mating optimizer: an [42] A. Milani, V. Santucci. "Community of scientist
optimization algorithm inspired by bird mating optimization: An autonomy oriented approach to
strategies", Communications in Nonlinear Science distributed optimization", AI Communications,
and Numerical Simulation, 19(4), pp1213-1228, 25(2), pp. 157-172, 2012
2014 [43] S. Iordache. "Consultant-guided search: a new
[28] Xian-Bing Meng, X.Z. Gao, Lihua Lu, Yu Liu & metaheuristic for combinatorial optimization
Hengzhen Zhang. “A new bio-inspired problems", In Proceedings of the 12th annual
optimisation algorithm: Bird Swarm Algorithm”, conference on Genetic and evolutionary
Journal of Experimental & Theoretical Artificial computation, Portland, OR, USA, pp. 225-232,
Intelligence, 28(4), pp 673-687, 2016 2009
[29] A. Hatamlou. "Black hole: A new heuristic [44] S. Salcedo-Sanz, J. Del Ser, I. Landa-Torres, S.
optimization approach for data clustering", Gil-López, J. A. Portilla-Figueras. "The coral reefs
Information Sciences, 222, pp 175-184, 2013 optimization algorithm: a novel metaheuristic for
[30] M. Taherdangkoo, M. H. Shirzadi M. Yazdi, M. H. efficiently solving optimization problems", The
Bagheri. "A robust clustering method based on Scientific World Journal, 2014
blind, naked mole-rats (BNMR) algorithm",
Glossary of Evolutionary Algorithms 201

[45] N. Hansen, Sibylle, D. Müller, P. Koumoutsakos. magnetism optimization", Information Sciences,

“Reducing the Time Complexity of the 182(1), pp 40-55, 2012
Derandomized Evolution Strategy with Covariance [60] G. Wang, S. Deb, L. S. Coelho, “Elephant
Matrix Adaptation (CMA-ES)”, Evolutionary Herding Optimization”, In proc of the 3rd
Computation, 11(1), pp 1-18, 2006 International Symposium on Computational and
[46] X. Feng, M. Ma, H. Yu. "Crystal Energy Business Intelligence (ISCBI), Bali, Indonesia, pp
Optimization Algorithm", Computational 1-5, 2015
Intelligence, 32(2), pp 284—322, 2016 [61] S. Deb, S. Fong, Z. Tian. "Elephant Search
[47] X. S. Yang, S. Deb. “Cuckoo Search via Lévy Algorithm for optimization problems", In Proc. of
flights”, In proceedings of 2009 World Congress the 10th IEEE International Conference on Digital
on Nature & Biologically Inspired Computing, Information Management (ICDIM), pp 249-255,
Coimbatore, India, pp 210-214, 2009 2015
[48] R. G. Reynolds. “An Introduction to Cultural [62] A. Auger. "Convergence results for the (1,λ)-SA-
Algorithms”, in Proceedings of the 3rd Annual ES using the theory of φ-irreducible Markov
Conference on Evolutionary Programming, World chains", Theoretical Computer Science, 334 (1-3),
Scientific Publishing, pp 131–139, 1994 pp 35–69, 2005
[49] A.S. Eesa, A.M. Abdulazeez, Z. Orman. [63] D. B. Fogel, L. J. Fogel. “An introduction to
“Cuttlefish algorithm - a novel bio-inspired evolutionary programming”, In Proceedings of
optimization algorithm”, International Journal of European Conference on Artificial Evolution, pp
Scientific and Engineering Research, 4(9), pp. 21-33, 1995
1978-1986, 2013 [64] N. Ghorbani, E. Babaei. “Exchange market
[50] S. Kadioglu, M. Sellmann. “Dialectic Search”, In algorithm.” Applied Soft Computing, 19, pp 177–
Proceedings of International Conference on 187, 2014
Principles and Practice of Constraint [65] N. Razmjooy, M. Khalilpour, M. Ramezani. "A
Programming, pp 486-500, 2009 New Meta-Heuristic Optimization Algorithm
[51] R. Storn, K. Price. "Differential evolution - a Inspired by FIFA World Cup Competitions:
simple and efficient heuristic for global Theory and Its Application in PID Designing for
optimization over continuous spaces", Journal of AVR System", Journal of Control, Automation and
Global Optimization, 11(4), pp 341–359, 1997 Electrical Systems, 27(4), 1-22, 2016
[52] P. Civicioglu. “Transforming geocentric cartesian [66] X. Yang. "Firefly algorithms for multimodal
coordinates to geodetic coordinates by using optimization." Stochastic algorithms: foundations
differential search algorithm”, Computers & and applications. Springer Berlin Heidelberg, pp
Geosciences, 46, pp 229–247, 2012 169-178, 2009
[53] A. Kaveh, N. Farhoudi. ”A new optimization [67] Y. Tan, Y. Zhu. "Fireworks algorithm for
method: Dolphin echolocation”, Advances in optimization" ”, In proceedings of International
Engineering Software, 59, pp.53-70, 2013 Conference in Swarm Intelligence, pp 355-364,
[54] Y. Shiqin, J. Jianjun, Y. Guangxing. “A Dolphin 2010
Partner Optimization”, In proc of 2009 WRI Global [68] C. J. A. B. Filho , F. B. L. Neto, A. J. C. C. Lins, A.
Congress on Intelligent Systems, Xiamen, China, I. S. Nascimento, M. P. Lima, “A novel search
pp 124-128, 2009 algorithm based on fish school behavior”, In
[55] S. Mirjalili. "Dragonfly algorithm: a new meta- proceedings of IEEE International Conference on
heuristic optimization technique for solving single- Systems, Man and Cybernetics, pp 2646-2651,
objective, discrete, and multi-objective problems", 2008
Neural Computing and Applications, 27(4), pp [69] X. Yang. "Flower pollination algorithm for global
1053-1073, 2016 optimization." In Proceedings of International
[56] X.S. Yang, S. Deb. "Eagle strategy using Lévy Conference on Unconventional Computing and
walk and firefly algorithms for stochastic Natural Computation, pp 240-249 , 2012
optimization." In Proceedings of Nature Inspired [70] A. E. Xavier, V. L. Xavier. "Flying elephants: a
Cooperative Strategies for Optimization (NICSO general method for solving non-differentiable
2010), pp. 101-111, 2010 problems", Journal of Heuristics, 22(4), pp 649-
[57] R.S. Parpinelli, H.S. Lopes. "An eco-inspired 664, 2016
evolutionary algorithm applied to numerical [71] M. Ghaemi, M. R. F. Derakhshi. “Forest
optimization." In proc. of the Third World Optimization Algorithm”, Expert Systems with
Congress on Nature and Biologically Inspired Applications, 41(15), 6676–6687, 2014
Computing (NaBIC), 2011, Spain, pp 466-471, [72] W. T. Pan. "A new fruit fly optimization algorithm:
2011 taking the financial distress model as an example",
[58] C. Sur, S. Sharma, A. Shukla. "Egyptian vulture Knowledge-Based Systems, 26, pp 69-74, 2012
optimization algorithm - a new nature inspired [73] H. Shah-Hosseini. "Principal components analysis
meta-heuristics for knapsack problem", In by the galaxy-based search algorithm: a novel
proceedings of the 9th International Conference on metaheuristic for continuous optimisation",
Computing and Information Technology (IC2IT), International Journal of Computational Science
Bangkok, pp. 227-237, 2013 and Engineering, 6(1/2), pp 132-140, 2011
[59] E. Cuevas, D. Oliva , D. Zaldivar, M. Pérez- [74] M. Abdechiri, M.R. Meybodi, H. Bahrami. “Gases
Cisneros, H. Sossa. "Circle detection using electro- Brownian motion optimization: an algorithm for
202 Rajpurohit, Sharma et al.

optimization (GBMO)”, Applied Soft Computing, [89] S. He, Q.H. Wu, J.R. Saunders. "Group search
13(5), pp 2932-2946, 2013 optimizer: an optimization algorithm inspired by
[75] C. Ferreira. "Gene expression programming in animal searching behavior", IEEE Transactions on
problem solving." In proceedings of Soft evolutionary computation, 13(5), pp 973-990, 2009
computing and industry, pp. 635-653, 2002 [90] Z. W. Geem, J. H. Kim, G. V. Loganathan. "A new
[76] H. Beiranvand, E. Rokrok. "General Relativity heuristic optimization algorithm: harmony search",
Search Algorithm: A Global Optimization Simulation, 76(2), pp 60-68, 2001
Approach", International Journal of [91] A. Hatamlou. "Heart: a novel optimization
Computational Intelligence and Applications, algorithm for cluster analysis", Progress in
14(3), 2015 Artificial Intelligence, 2(2), pp 167-173, 2014
[77] D. E. Goldberg. “Genetic Algorithms in Search, [92] H. Chen, Y. Zhu, K. Hu, X. He. “Hierarchical
Optimization, and Machine Learning”, Swarm Model: A New Approach to Optimization”,
ADDISON-WESLEY PUBLISHING COMPANY, Discrete Dynamics in Nature and Society, 2010
1989 [93] H.A. Abbass. "MBO: Marriage in honey bees
[78] K. N. Krishnanand, D. Ghose. "Glowworm swarm optimization - A haplometrosis polygynous
optimization for simultaneous capture of multiple swarming approach" In proceedings of the IEEE
local optima of multimodal functions", Swarm Congress on Evolutionary Computation, Vol. 1, pp
intelligence, 3(2), pp 87-124, 2009 207-214, 2001
[79] E. Osaba, F. Diaz, E. Onieva. “Golden ball: a novel [94] M. El-Dosuky, A. El-Bassiouny, T. Hamza, M.
meta-heuristic to solve combinatorial optimization Rashad. "New hoopoe heuristic optimization",
problems based on soccer concepts”, Applied International Journal of Science and Advanced
Intelligence. 41(1), pp 145-166, 2014 Technology, 2(9), pp 85-90, 2012
[80] S. Su, J. Wang, W. Fan, X. Yin. “Good Lattice [95] L.M. Zhang, C. Dahlmann, Y. Zhang. "Human-
Swarm Algorithm for Constrained Engineering inspired algorithms for continuous function
Design Optimization”, In proceedings of the optimization", In proceeding of the IEEE
International Conference on Wireless International Conference on Intelligent Computing
Communications, Networking and Mobile and Intelligent Systems, ICIS 2009, Vol. 1, pp 318-
Computing, pp 6421-6424, 2007 321, 2009
[81] S. Saremi, S. Mirjalili, A. Lewis. “Grasshopper [96] R. Oftadeh, M. J. Mahjoob. “A new meta-heuristic
Optimisation Algorithm: Theory and application”, optimization algorithm: Hunting Search”, In
Advances in Engineering Software, 105, pp 30-47, proceeding of the Fifth International Conference
2017 on Soft Computing, Computing with Words and
[82] B. Webster, P.J. Bernhard. "A local search Perceptions in System Analysis, Decision and
optimization algorithm based on natural principles Control, 2009
of gravitation", In Proceedings of the international [97] E. Atashpaz-Gargari, C. Lucas. "Imperialist
conference on information and knowledge competitive algorithm: an algorithm for
engineering (IKE’03), pp 255–261, 2003 optimization inspired by imperialistic competition",
[83] G. Dueck. "New Optimization Heuristics The In Proceedings of the IEEE Congress on
Great Deluge Algorithm and the Record-to-Record Evolutionary Computation, 2007
Travel", Journal of Computational Physics, 104(1), [98] H. Shah-Hosseini. "The intelligent water drops
pp 86-92, 1993 algorithm: a nature-inspired swarm-based
[84] A. Mozaffari, A. Fathi, S. Behzadipour. "The great optimization algorithm", International Journal of
salmon run: a novel bio-inspired algorithm for Bio-Inspired Computation, 1(1/2), pp 71-79, 2009
artificial system design and optimisation", [99] A. H. Gandomi. “Interior search algorithm (ISA): a
International Journal of Bio-Inspired Computation, novel approach for global optimization”, ISA
4(5), pp 286-301, 2012 transactions, 53(4), pp 1168-1183, 2014
[85] J.M.L. Melvix. "Greedy Politics Optimization: [100] D. Tang, S. Dong, Y. Jiang, H. Li, Y. Huang.
Metaheuristic inspired by political strategies "ITGO: Invasive tumor growth optimization
adopted during state assembly elections", In algorithm", Applied Soft Computing, (36), pp. 670-
proceedings of the IEEE International Advance 698, 2015
Computing Conference (IACC), pp 1157-1162, [101] A. R. Mehrabian, C. Lucas. "A novel numerical
2014 optimization algorithm inspired from weed
[86] A. Ahrari, A. A. Atai. "Grenade explosion method colonization", Ecological informatics, 1(4), pp
- a novel tool for optimization of multimodal 355-366, 2006
functions", Applied Soft Computing, 10(4), pp [102] B. Javidy, A. Hatamlou, S. Mirjalili. "Ions
1132-1140, 2010 motion algorithm for solving optimization
[87] S. Mirjalili, S. M. Mirjalili, A. Lewis. "Grey wolf problems", Applied Soft Computing, 32(1), pp 72-
optimizer." Advances in Engineering Software, 69, 79, 2015
pp 46-61, 2014 [103] C. Chen, Y. Tsai, I. Liu, C. Lai, Y. Yeh, S.
[88] M.A. Eita, M. M. Fahm. "Group counseling Kuo, Y. Chou. "A Novel Metaheuristic: Jaguar
optimization: a novel approach", In proceedings of Algorithm with Learning Behavior." In
Research and Development in Intelligent Systems Proceedings of the IEEE International Conference
XXVI, pp 195-208, 2010 on Systems, Man, and Cybernetics (SMC), pp.
1595-1600, 2015
Glossary of Evolutionary Algorithms 203

[104] H. Hernández, C. Blum. "Distributed graph Computers & Operations Research, 55, pp.99-125,
coloring: an approach based on the calling behavior 2015
of Japanese tree frogs", Swarm Intelligence, 6(2), [120] U. Premaratne, J. Samarabandu, T. Sidhu. "A
pp 117-150 new biologically inspired optimization algorithm"
[105] V. V. Melo. “Kaizen Programming", In In proceedings of the 2009 international
Proceedings of the 2014 Annual Conference on conference on industrial and information systems,
Genetic and Evolutionary Computation (GECCO), pp 279-284, 2009
pp 895-902, 2014 [121] A. Borji, “A new global optimization algorithm
[106] M. Hajiaghaei-Keshteli, M. Aminnayeri. inspired by parliamentary political competitions”,
“Solving the integrated scheduling of production In Proceedings of the Mexican International
rail transportation problem by Keshtel algorithm”, Conference on Artificial Intelligence, pp 61-71,
Applied Soft Computing, 25, pp 184–203, 2014 2007
[107] A. H. Gandomi, A. H. Alavi. "Krill herd: a new [122] R. Eberhart, J. Kennedy. “A New Optimizer
bio-inspired optimization algorithm ", Using Particle Swarm Theory”, In proceedings of
Communications in Nonlinear Science and the Sixth International Symposium on Machine and
Numerical Simulation, 17(12), pp 4831-4845, 2012 Human Science, pp. 39-43, 1995
[108] A. H. Kashan. "League Championship Algorithm: [123] R. Hooke, T. A. Jeeves. "Direct search" solution
A New Algorithm for Numerical Function of numerical and statistical problems", Journal of
Optimization", In proceedings of International the Association for Computing Machinery
Conference of Soft Computing and Pattern (ACM). 8 (2), pp 212–229, 1961
Recognition, Malacca, Malaysia, pp 43-48, 2009 [124] Y. Gheraibia, A. Moussaoui. “Penguins search
[109] H. Shareef, A.A. Ibrahim, A.H. Mutlag. optimization algorithm (PeSOA)”, In proceedings
"Lightning search algorithm", Applied Soft of the International Conference on Industrial,
Computing, 36(1), pp 315-333, 2015 Engineering and Other Applications of Applied
[110] M. Yazdani, F. Jolai. "Lion Optimization Intelligent Systems, pp 222-231, 2013
Algorithm (LOA): A nature-inspired metaheuristic [125] H. Murase, A. Wadano. “Photosynthetic
algorithm", Journal of Computational Design and Algorithm for Machine Learning and TSP”, IFAC
Engineering, 3(1), pp 24-36, 2016 Proceedings Volumes, 31(12), pp 19-24, 1998
[111] S. Chen. “Locust Swarms - A new multi-optima [126] W. Cai, W. Yang, X. Chen. “A Global
search technique”, In proceeding of the IEEE Optimization Algorithm Based on Plant Growth
Congress on Evolutionary Computation, Theory: Plant Growth Optimization”, Proceedings
Trondheim, Norway, pp 1745-1752, 2009 of the 2008 International Conference on Intelligent
[112] H. Mo, L. Xu. "Magnetotactic bacteria Computation Technology and Automation, pp
optimization algorithm for multimodal 1194-1199, 2008
optimization", In the proceedings of the 2013 IEEE [127] A. Salhi, E. S. Fraga. “Nature-Inspired
Symposium on Swarm Intelligence (SIS), pp 240- Optimisation Approaches and the New Plant
247, 2013 Propagation Algorithm”, In Proceedings of the The
[113] E. Duman, M. Uysal, A. F. Alkaya1. “Migrating International Conference on Numerical Analysis
Birds Optimization: A New Meta-heuristic and Optimization (ICeMATH ’11), Yogyakarta,
Approach and Its Application to the Quadratic Indonesia, pp K2-1-K2-8, 2011
Assignment Problem”, In proceedings of the [128] É. D. Taillard, S. Voss. “Popmusic — Partial
European Conference on the Applications of Optimization Metaheuristic under Special
Evolutionary Computation, pp 254-263, 2011 Intensification Conditions”, Essays and Surveys
[114] A. Sadollah, A. Bahreininejad, H. Eskandar, M. in Metaheuristics, Operations Research/Computer
Hamdi. “Mine blast algorithm for optimization of Science Interfaces Series, 15, pp 613-629, 2001
truss structures with discrete variables”, Computers [129] S.H. Jung. "Queen-bee evolution for genetic
and Structures, (102–103), pp 49–63, 2012 algorithms", Electronics letters, 39(6), pp 575-576,
[115] G. Wang, S. Deb, Z. Cui. "Monarch butterfly 2003
optimization",, Neural Computing and [130] A. Brabazon, W. Cui, M. O’Neill. “The raven
Applications, pp 1-20, 2015 roosting optimisation algorithm”, Soft
[116] A. Mucherino, O. Seref. "Monkey search: a novel Computing, 20(2), pp 525–545, 2014
metaheuristic search for global optimization", Data [131] A. Kaveh, M. Khayatazad. "A new meta-
Mining, Systems Analysis and Optimization in heuristic method: ray optimization", Computers &
Biomedicine, 953(1) , 2007 Structures, (112), pp 283-294, 2012
[117] S. Mirjalili. "Moth-flame optimization algorithm: [132] A. Sharma. “A new optimizing algorithm using
A novel nature-inspired heuristic paradigm", reincarnation concept”, In the proceeding of the
Knowledge-Based Systems, 89, 228-249, 2015 11th IEEE International Symposium on
[118] S. Mirjalili, S. M. Mirjalili, A. Hatamlou. “Multi- Computational Intelligence and Informatics
Verse Optimizer: a nature-inspired algorithm for (CINTI), pp. 281-288, 2010
global optimization.” Neural Computing & [133] P. Rabanal, I. Rodrí guez, F. Rubio. "Using river
Applications, 27(2), pp 1-19, 2015 formation dynamics to design heuristic algorithms",
[119] A.H. Kashan. “A new metaheuristic for In the proceedings of the International Conference
optimization: optics inspired optimization(OIO)”, on Unconventional Computation, pp 163-177,
2007
204 Rajpurohit, Sharma et al.

[134] T. C. Havens, C. J. Spain, N. G. Salmon, J. M. algorithm", Meta-Heuristics optimization

Keller. "Roach infestation optimization", In algorithms in engineering, business, economics,
proceedings of the IEEE Swarm Intelligence and finance. IGI Global, 2012
Symposium, SIS 2008, pp 1-7, 2008 [149] Xiao-Feng Xie, Wen-Jun Zhang, Zhi-Lian Yang,
[135] X. Hea, S. Zhang, J. Wang. “A Novel Algorithm “Social cognitive optimization for nonlinear
Inspired by Plant Root Growth with Self-similarity programming problems”, Proceedings of the First
Propagation”, In proceedings of the 1st International Conference on Machine Learning
International Conference on Industrial Networks and Cybernetics, Beijing, China, pp 779-783, 2002
and Intelligent Systems (INISCom), pp 157-162, [150] Y. Xu, Z. Cui, J. Zeng, "Social emotional
2015 optimization algorithm for nonlinear constrained
[136] Y. Labbi, D. B. Attous, H. A. Gabbar, B. Mahdad, optimization problems." In Proceedings of the
A. Zidan. “A new rooted tree optimization International Conference on Swarm, Evolutionary,
algorithm for economic dispatch with valve-point and Memetic Computing, pp 583-590, 2010
effect”, International Journal of Electrical Power [151] Erik Cuevas,Miguel Cienfuegos, Daniel
& Energy Systems, 79, pp 298-311, 2016 Zaldívar , Marco Pérez-Cisneros, “A swarm
[137] F. Merrikh-Bayat. "The runner-root algorithm: A optimization algorithm inspired in the behavior of
metaheuristic for solving unimodal and multimodal the social-spider”, Expert Systems with
optimization problems inspired by runners and Applications, 40(16), pp 6374-6384, 2013
roots of plants in nature", Applied Soft Computing, [152] Ray, Tapabrata, and Kim Meow Liew, "Society
(33), pp 292-303, 2015 and civilization: An optimization algorithm based
[138] A. Karci, B. Alatas. “Thinking Capability of on the simulation of social behavior", IEEE
Saplings Growing Up Algorithm”, In the Transactions on Evolutionary Computation, 7(4),
proceedings of International Conference on pp 386-396, 2003
Intelligent Data Engineering and Automated [153] Raouf, Hezam, "Sperm motility algorithm: a
Learning, pp 386-393, 2006 novel metaheuristic approach for global
[139] F. Glover. “Heuristics for Integer Programming optimisation", International Journal of
Using Surrogate Constraints”, Decision Sciences, 8, Operational Research (IJOR), 28(2) , 2017
pp 156-166, 1977 [154] A. Ebrahimi, E. Khamehchi, “Sperm Whale
[140] D. Felipe, E. Goldbarg, M. Goldbarg. "Scientific Algorithm: an Effective Metaheuristic Algorithm
algorithms for the Car Renter Salesman Problem." for Production Optimization Problems”, Journal of
In Proceedings of the IEEE Congress on Natural Gas Science & Engineering, 29, pp 211-
Evolutionary Computation (CEC), Beijing, China, 222, 2016
pp. 873-879, 2014 [155] Jagdish Chand Bansal, Harish Sharma,
[141] P. Wang, Z. Zhu, S. Huang. "Seven-spot ladybird Shimpi Singh Jadon, Maurice Clerc, “Spider
optimization: a novel and efficient metaheuristic monkey optimization algorithm for numerical
algorithm for numerical optimization", The optimization", Memetic Computing, 6(1), pp 31-47,
Scientific World Journal, 2013, 378515, 2013 2014
[142] O. Abedinia, N. Amjady, A. Ghasemi. "A new [156] K. Tamura, K. Yasuda, "Spiral Dynamics
metaheuristic algorithm based on shark smell Inspired Optimization." Journal of Advanced
optimization", Complexity, 2014 Computational Intelligence and Intelligent
[143] H. Kim, B. Ahn. "A new evolutionary algorithm Informatics, 15(8), pp 1116-1122, 2011
based on sheep flocks heredity model", In [157] Bishop, J.M., “Stochastic Searching Networks”,
Proceedings of the IEEE Pacific Rim Conference Proc. 1st IEE Conf. on Artificial Neural Networks,
on Communications, Computers and signal London, pp 329–331, 1989
Processing, PACRIM, vol. 2, pp 514-517, 2001 [158] H. Salimi, “Stochastic fractal search: a powerful
[144] M. Eusuff, K.E. Lansey. "Optimization of water metaheuristic algorithm”, Knowledge-Based
distribution network design using the shuffled frog Systems, 75, pp1-18, 2015
leaping algorithm", Journal of Water Resources [159] F. Merrikh-Bayat, “A Numerical Optimization
Planning and Management, 129(3), pp 210–225, Algorithm Inspired by the Strawberry Plant’, arXiv
2003 preprint arXiv:1407.7399, 2014
[145] J. P. Pedroso. “Simple meta-heuristics using the [160] Mehdi Neshat, Ghodrat Sepidnam, Mehdi
simplex algorithm for non-linear programming”, Sargolzaei, "Swallow swarm optimization
Technical Report DCC-2007-06, DCC, FC, algorithm: a new method to optimization", Neural
Universidade do Porto, 2007 Computing and Applications, 23(2), pp 429-454,
[146] S. Kirkpatrick, D. Gelatt Jr., and M. P. Vecchi, 2013
"Optimization by simulated annealing", Science, [161] M.Y. Cheng, D. Prayogo. “Symbiotic organisms
220(4598), pp 671–680, 1983 search: a new metaheuristic optimization
[147] H Du, X Wu, J Zhuang, "Small-world algorithm”, Computers & Structures, 139, pp 98-
optimization algorithm for function optimization", 112, 2014
Advances in Natural Computation, pp 264-273, [162] F. Glover. "Future Paths for Integer
2006 Programming and Links to Artificial Intelligence",
[148] H.D. Purnomo, H.-M. Wee., "Soccer game Computers and Operations Research, 13 (5), pp
optimization: an innovative integration of 533–549, 1986
evolutionary algorithm and swarm intelligence
Glossary of Evolutionary Algorithms 205

[163] R. V. Rao, V. J. Savsani, D. P. Vakharia. Proceedings of the 2014 International Conference

“Teaching-learning-based optimization: a novel on Industrial Engineering and Operations
method for constrained mechanical design Management, pp 2499-2505, 2014
optimization problems”, Computer-Aided Design, [178] H. T. Nguyen, B. Bhanu. “Zombie Survival
43, (3), pp 303–315, 2011 Optimization: A swarm intelligence algorithm
[164] R. Hedayatzadeh, F. A. Salmassi, R. Akbari, K. inspired by zombie foraging", In Proceedings of
Ziarati. "Termite colony optimization: A novel 21st IEEE International Conference on Pattern
approach for optimizing continuous problems", In Recognition (ICPR), Tsukuba, Japan, pp 987-990,
the proceedings of 2010 18th IEEE Iranian 2012
Conference on Electrical Engineering, pp. 553-558,
2010 Author Biographies
[165] P. Cortés, J. M. García, J. Muñuzuri, L. Onieva.
Jitendra Rajpurohit completed his B. Tech. from University of
"Viral systems: A new bio-inspired optimisation Rajasthan and M. Tech. from Rajasthan
approach", Computers & Operations Research, Technical University in Computer Science
35(9), pp 2840-2860, 2008 Engineering in 2006 and 2013 respectively.
[166] M. D. Li, H. Zhao, X. W. Weng, T. Han. “A He is presently pursuing his Ph.D. from
novel nature-inspired algorithm for optimization: Amity University Rajasthan, India. His
Virus colony search”, Advances in Engineering research areas are Evolutionary & Swarm
Software, 92, pp 65-88, 2016 Intelligence Algorithms and their
[167] Y. C. Liang, J. R. C. Juarez. “A novel applications in engineering design. He has
published about 20 research papers in
metaheuristic for continuous optimization
Journals of repute and in refereed international conferences. He is
problems: Virus optimization algorithm”, also contributing to reviewer and editorial boards of a few reputed
Engineering Optimization, 48(1), pp 73-93, 2016 journals.
[168] B. Dogan, T. Olmez. "A new metaheuristic for
numerical function optimization: Vortex Search Tarun Kumar Sharma did his Ph.D. in
Algorithm", Information Sciences, 293, pp 125- Computational Intelligence from IIT
145, 2015 Roorkee and presently associated as
[169] P. Pinto, T. A. Runkler, J. M. Sousa. “Wasp Associate Professor in the department of
Computer Engineering at Amity School of
swarm optimization of logistic systems”, Adaptive
Engineering & Technology, Amity
and Natural Computing Algorithms, pp 264-267, University Rajasthan, India. His research
2005 areas are evolutionary & Swarm intelligence
[170] H. Eskandar, A. Sadollah, A. Bahreininejad, M. algorithms and their applications in Software
Hamdi. “Water cycle algorithm – A novel Engineering. He is in Editorial Board and
metaheuristic optimization method for solving reviewer of many refereed Journals of repute. He has published about
constrained engineering optimization problems”, 100 research papers in Journals of repute and in refereed international
Computers & Structures, 110-111, pp 151-166, conferences. He is a Program Chair of SoCTA2017.
.
2012
Ajith Abraham received the Ph.D. degree
[171] A. Kaveh, T. Bakhshpoori. "Water Evaporation in Computer Science from Monash
Optimization: A novel physically inspired University, Melbourne, Australia. He is
optimization algorithm", Computers & Structures, currently coordinating the efforts of
167, pp 69-85, 2016 Machine Intelligence Research Labs (MIR
[172] Y. J. Zheng. “Water wave optimization: a new Labs), Scientific Network for Innovation
nature-inspired metaheuristic”, Computers & and Research Excellence, USA, which has
Operations Research, 55, pp 1-11, 2015 members from more than 100+ countries.
[173] T. H. Tran, K. M. Ng. “A water-flow algorithm He has a worldwide academic experience
with formal appointments in several Universities in Asia, Australia,
for flexible flow shop scheduling
Europe and the US. He serves/has served the editorial board of over
with intermediate buffers”, Journal of Scheduling, 50 International journals and has also guest edited 40 special issues
14(5), pp 483-500, 2011 on various topics related to machine intelligence. He is a co-author
[174] S. Mirjalili, A. Lewisa. "The Whale Optimization of more than 1000+ research publications, and some of the works
Algorithm", Advances in Engineering Software, 95, have also won best paper awards at international conferences.
pp 51-67, 2016
[175] Z. Bayraktar, M. Komurcu, D. H. Werner. Vaishali Completed her initial education
"Wind Driven Optimization (WDO): A novel from various reputed educational institutes
nature-inspired optimization algorithm and its of Haryana in India. She completed her B.
Tech (Information Technology) and M.
application to electromagnetics", In proceedings of
Tech. (Computer Science & Engineering)
2010 IEEE Antennas and Propagation Society in 2007 and 2010 respectively. Currently
International Symposium, pp 1-4, 2012 she is pursuing her Ph. D. from Amity
[176] R. Tang, S. Fong, X. S. Yang, S. Deb. "Wolf University Rajasthan. Her areas of interest
search algorithm with ephemeral memory". In are Evolutionary algorithm, and their real
proceedings of Seventh International Conference world applications. She has published
on Digital Information Management, pp 165–172, about 20 research papers in Journals of
2012 repute and in refereed international conferences. She is also
[177] J.P. Arnaout. "Worm Optimization: A novel contributing to reviewer and editorial boards of a few reputed
journals.
optimization algorithm inspired by C. Elegans". In