Bio-Inspired Algorithm:-
(i)The bio-inspired algorithms are broadly classified as evolutionary algorithms,
which are based on Darwin's theory of survival of the fittest and natural selection,
and swarm intelligence algorithms, which are based on behavioral models of
social creatures such as ants, honey bees, fireflies, fish, birds, etc.
(ii)Bio-inspired optimization is a term that covers a wide variety of computational
approaches that are based on the principles of biological systems. This motivates
the application of biology to optimization problems.
(iii)Solving an optimization problem by mathematical or traditional modeling
methods can be difficult or even impossible in practice – due to, for example, the
existence of non-convex functions and discrete variables. However, by applying
bio-inspired methodologies, it is possible to solve complex optimization problems
with high-quality solutions.
(iv)Computational algorithms which has been designed and optimized with inputs
from the behavior of biological systems like an ant or bee colony or biological
entities like a cell or neuron. Example: artificial neural network, genetic algorithm,
membrane computing
(v)The main advantage is possible to solve complex optimization problems with
high-quality solutions.
Flowchart for bio inspired algorithm:-
Harmony search algorithm:-
(i)Harmony Search Algorithm (HAS) was first introduced in 2001.
(ii)Harmony search (HS) is a meta-heuristic search algorithm which tries to mimic
the improvisation process of musicians in finding a pleasing harmony.
(iii)In the next years, it is expected that HS is applied to more real optimization
problems.
(iv)Optimization is the process for selecting the best possible value of decision
variables from the available set of values under some specific constraints .This
process is used to minimize or maximize the fitness function of the optimization
problems
(V)HAS is equivalent to an evolution strategy (ES). The ES, based on ideas of
adaptation and evolution, consists of two operators:- recombination and
mutation operators.
(vi)The method used to search perfect solutions for the given problem is similar to
the method used by a musician who tries to find harmony delightful to the ears.
(vii)The method used for deriving the value of fitness function is similar to the
method of deriving a standard with the help of pitch of every musical instrument.
(vii)A number of metaheuristic algorithms are developed in the literature. Some
of the well-known techniques are genetic algorithm (GA), ant colony optimization
(ACO), particle swarm optimization (PSO), grey wolf optimization (GWO),
harmony search algorithm (HAS).
Advantages of HS:-
HS algorithm has several impressive advantages, such as
(i)easy implementation
(ii)less adjustable parameters
(iii) and quick convergence.
Applications of HS:-
(i)Due to the easy implementation and proficiency of HAS, it is used in a large
number of applications.
(ii)The applications of HAS are categorized into following classes such as image
processing, clustering, civil engineering, electrical engineering, bioinformatics,
software engineering, scheduling, mechanical engineering, industrial engineering,
networking, and other engineering applications.
Flow Chart for HS Algorithm:-
Honey-Bee Optimization algorithm:-
(i)Bee System is an improved version of the Genetic Algorithm (GA).
(ii)The main purpose of the algorithm is to improve local search while keeping the
global search ability of GA.
(iii)In nature, honey bees have several complicated behaviors such as mating,
breeding and foraging. These behaviors have been mimicked for several honey
bee based optimization algorithms.
(iv) of the famous mating and breeding behavior of honey bees inspired algorithm
is Marriage in Honey Bees Optimization (MBO).
(v)The other type of bee-inspired algorithms mimics the foraging behavior of the
honey bees.
(vi) The following algorithms were inspired from foraging behavior of honey bees;
Bee System (BS), Bee Colony Optimization (BCO), Artificial Bee Colony (ABC) and
The Bees Algorithm (BA).
(vii)The algorithm performs both an exploitative neighborhood search combined
with random explorative search.
(vii)The BA has been successfully applied on several optimization problems as
multi-objective optimization.
Advantages:
The algorithm has
• local search and global search ability,
• Implemented with several optimization problems,
• Easy to use,
• Available for hybridization combination with other algorithms.
Disadvantages:
• Random initialization,
• The algorithm has several parameters,
• Parameters need to be tuned.
Pseudocode for Honey-Bee Optimization:-
Memetic Algorithm:-
(i)Memetics is the study of information and culture based on an analogy with
Darwinian evolution.
(ii)Memetic algorithm introduced by Moscato and Norman in 1992 is an improved
variant of genetic algorithm.
(iii)Memetic algorithms (Mas) are evolutionary algorithms that use another local
search rather than global search algorithms. Mas are evolutionary algorithms that
use local search processes to refine individuals.
(iv) When we combine global and local search, it becomes a global optimization
process.
(v) It takes the concept of evolution as in genetic algorithm.
(vi) However, while genetic algorithm is based on biological evolution, memetic
algorithm is based on cultural evolution or idea evolution.
(vii)In the evolution of ideas, an idea may be improved not only by recombination
from others, but also by adaptation from itself.
(vii)the main advantage is it may provide a sufficiently good solution to an
optimization problem. And It uses a local search technique to reduce the
likelihood of premature convergence.
Pseudocode for Memetic Algorithm:-
Co-evolutionary algorithm:-
(i)A co-evolutionary algorithm is an evolutionary algorithm (or collection of
evolutionary algorithms) in which the fitness of an individual is subjective; that is,
the individuals are evaluated based on their interactions with other individuals.
(ii)The main classes of EA in contemporary usage are (in order of popularity)
genetic algorithms (Gas), evolution strategies (ESs), differential evolution (DE) and
estimation of distribution algorithms (EDAs).
(iii)The main classes of EA in contemporary usage are (in order of popularity)
• genetic algorithms (Gas)
• evolution strategies (ESs)
• differential evolution (DE)
• and estimation of distribution algorithms (EDAs).
(iv)Evolutionary algorithms are typically used to provide good approximate
solutions to problems that cannot be solved easily using other techniques.
(v)Many optimisation problems fall into this category It may be too
computationally-intensive to find an exact solution but sometimes a near-optimal
solution is sufficient.
(vi)Specific advantages include the flexibility of the procedures, as well as their
ability to self-adapt the search for optimum solutions on the fly.
Steps for co-evolutionary algorithm:-
Initialization:
In order to begin our algorithm, we must first create an initial population of
solutions.
Selection:
Once a population is created, members of the population must now be evaluated
according to a fitness function.
Genetic Operators:
This step really includes two sub-steps:
(i)crossover
(ii)Mutation.
Termination
Eventually, the algorithm must end. There are two cases in which this usually
occurs: either the algorithm has reached some maximum runtime, or the
algorithm has reached some threshold of performance. At this point a final
solution is selected and returned.
