2013 International Conference on Machine Intelligence and

Research
Research
and Advancement

Adaptive & Discrete Real Bat Algorithms for Route Search Optimization of Graph
Based Road Network
Chiranjib Sur, Anupam Shukla
Soft Computing and Expert System Laboratory
ABV-Indian Institute of Information Technology & Management
Gwalior, Madhya Pradesh, India 474010
Email: chiranjibsur@gmail.com, dranupamshukla@gmail.com
of road network which are being used in modeling the
network and the details are given in Section III. Such multiparameters network also has several criteria of path selection
for different types of vehicles and their choices. Also we
have introduced a new model of discrete or binary bat
algorithm which will adapt to the multi-objective search
scenario and provide the dynamicity for this type of complex
dynamic problem.
In [2] for the first time Bat Algorithm was introduced for
the first time as a swarm particle optimization by X. S. Yang
in 2010 that has been suitable for continuous search space
based optimization. The mathematical expressions of BA
have been claimed as a modified version of the Particle
Swarm Optimization algorithm with enhanced parameter
control and there are several application where it has been
used like continuous domain numerical optimization [2],
spam filter optimization [11], [12] introduced the discrete or
binary version of BA for feature selection problem. Apart
from these ACO [8, 13], IWD [9], Egyptian Vulture
Optimization [14-15] algorithm etc are the main graph based
meta-heuristics. [7] has given discrete adaptability of PSO
and has been efficiently used in discrete problem like TSP,
etc but practically it cannot be utilized for graph based search
problems. In this work we have introduced several discrete
Bat algorithms and exclusively used the Real Bat Algorithm
for optimized path selection for road network.
Road network has been a favorite graph based problem
which has some unique properties and requires special
attention for modeling. Several places impose different road
constraints and it is required to incorporate them in
mathematics. Apart from parameters there are situations
where road may allow some limited type of vehicles, or may
have several lanes. There are places where the vehicles first
allow the pedestrians and then pass by. There are cases of
tidal lanes where the flow and direction of vehicles change
with requirement and may have several lanes divided.
Restricted flow lanes may force the vehicle to move at least
with a certain minimum speed. In this simulation setup we
have considered road having several static parameters like
distance, and dynamic parameters like average waiting time,
which will have significant contribution in the decision
making of the best path. There are several assumption and
hypothetical approximations considered in the modeling of
the road network so that the complexity is reduced and the
basic features of the vehicle characteristics are approximated
to suit the situation. This will abstract the unnecessary details
and overall implementation will consist of average or

Abstract Bat Algorithm (BA) has recently emerged as an

efficient nature inspired meta-heuristics due to its added
parameters and searching features. In this paper modified
versions of discrete bat algorithm is being proposed for the
first time which will suit the discrete domain problems. Here
the BA has utilized the famous three variable dependent
Weibull Cumulative Distribution Function as Weibull Coded
Binary Bat Algorithm (WCBBA), another as Real Bat
Algorithm (RBA) and the third as the hybrid of the two, for
search process with its modeling according to a road network
management system where it is being tried to optimize the
travel route and produce a vehicle load balancing structure of
the network through optimized path establishment. In bat
algorithm apart from the search criteria where the virtual bats
move, they also utilize their Echolocation property for further
investigation of the search space for prey. This makes the
heuristic more probabilistic, dynamic and adaptive and the
bats can reach a better solution through continuous analysis
and exploration. Here the bat algorithm is modeled to handle a
multi-objective optimization model where each bat tries to
optimize its own route criteria or rather tries to find its liking
prey. The enhanced search criteria of bats helps in reducing
the number of bats for the search process, but as the
Echolocation process spreads out it increases the complexity of
the search process that is parallelism is traded off with
complexity. The results show that the algorithm has potential
for better results and has been compared with the converging
rate of Ant Colony Optimization (ACO) & Intelligent Water
Drops (IWD) algorithms.
Keywords- real bat algorithm, routing optimization, nature
inspired computation, graph/combinatorial optimization

I.

INTRODUCTION

Road management has become an issue with the increase

in the number of vehicles and due to the existing inefficient
traffic management system. An effort has been very often on
finding the least path for path planning problem, but if the
number of agents increases the least path criteria can become
a bottleneck for the system due to the huge accumulation and
lead to congestion. Unlike the computer data network where
this kind of congestion is handled with hard hand and the
packets are dropped or re-routed or failure message can
handle the situation compelling the user and other network
managers to trace other routes to destination, in road network
there is no scope of such kind of congestion avoidance and
hence prevention through proper modeling and optimized
algorithm is the only way out. There are various parameters
978-0-7695-5013-8/13 $31.00 2013 IEEE
DOI 10.1109/ICMIRA.2013.30

120

approximated consideration of the whole event. Like the

vehicles considered here are of equal size and their velocities
are uniform and same. Also the road network will consist of
vehicles flowing from all over the parts to all other parts of
the network, but the effect of all them are considered as a
summation in parameters like queue length, average waiting
time etc. Also the variations of these kinds of dynamic
parameters are considered as a random number of certain
ranges. The rest of the paper is arranged as Section II for the
traditional BA, Section III for modified discrete BA, Section
IV for modified adaptive BA, Section V for methods,
Section VI for results, Section VII concludes with future
work.
II.

All bats use echolocation to sense distance, and they

also know the difference between food/prey and
background barriers in some magical way;
[This assumption is generated because the bat estimates the
distance when the sound signal gets reflected from any
obstacle, so if the estimation of the obstacle is known then
the distance between the bat and the prey can be perceived
easily.]
Bats fly randomly with velocity vi at position xi with a
fixed frequency fmin, varying wavelength and loudness
A0 to search for prey. They can automatically adjust the
wavelength (or frequency) of their emitted pulses and
adjust the rate of pulse emission r  [0, 1], depending
on the proximity of their target;
[Now the detection of a certain size of object using a signal
will depend on the frequency of the signal, hence it becomes
necessary for proper choosing of the frequency. In the metaheuristic search it is of no importance or may be of
importance as in the new discrete bat algorithm, but the
main point is to make the scenario like a bats environment,
these assumptions are necessary. ]
Although the loudness can vary in many ways, we
assume that the loudness varies from a large (positive)
A0 to a minimum constant value Amin.
[Loudness is related to the energy content of the signal and
for distant objects larger loudness is required, hence the bat
varies or rather experiments various loudness to see which
one is best suited for a situation and analysis of the distance
of the prey. Bat learns such thing from experiences by using
the loudness for various searches and also in the metaheuristics the loudness is varied according to parameter
and the loudness is increased gradually till the best solution
is reached. Best solution will indicate that the shout
loudness is perfect and dont need to increase further.]

BAT ALGORITHM & MATHEMATICS

Bat algorithm was first introduced by Xin-She Yang in the

year 2010 [2] imitating the natural process of the bats for
capturing its prey. Several equations having parameters
similar to the characteristics of bats are being formulated to
describe the natural process and were best suited for the
continuous search space problems. The three basic
equations are:
(1)
(2)
(3)
where fi is the frequency at which the bat moves and is the
control parameter of velocity and depends on the factor
(generated as a random number and  (0,1)), fi is limited
with fmin and fmax as the minimum and maximum frequency
to avoid unacceptable increase in velocity and in such case
the position may land up in some imaginary search space, vij
is the velocity component contributing to the step size for
movement of the bat and xij is the position vector and the
dimension of xij depends on the number of variables. [4]
described the binary BA where the first two equations
persist and two new equations were introduced so that the
binary mapping property can be imbibed in the formulation.
The binary BA equations consisted of Equation (1) and (2)
and the followings:

III.

MODIFIED DISCRETE BAT ALGORITHM

We have introduced two new discrete bat algorithms which

generate some conveniences in dealing with road network
(graph) problem and also produce the scheme of
adaptability, so that it can become more flexible,
probabilistic and merging of solution can be achieved more
quickly.

(4)

A. Real Bat Algorithm (RBA)

Bat is characterized for its Echolocation character and
this is the reason why they exist in this world with totally
unique mode of senses, detection of object, static or mobile,
in its surroundings. The bat shouts with a certain frequency
and the reflection of sound echo helps in detecting an object
and the Doppler Effect is analyzed for its frequency and
speed. This property is used here for searching process of
the domain and is suitable for graph kind of problems.
However this property can also be forged for continuous
search domain. The algorithm is more deterministic and
partly stochastic.

(5)
where Sigmoid{} is the sigmoid function. Rests of the
notations are same as above. However the position vector xij
now possess a different meaning unlike the previous general
bat algorithm. Previously it signified only the position from
a reference but with binary value it indicates whether it will
select an edge or not for a graph based optimized path
planning.
There were some assumptions which were described or
rather assumed in the bat algorithm by the author in [2]:

121

(a)
rn = rn {parameter set of network} where rn 0
mn = mn {parameter set of network} where mn 0 (b)
An = An - {parameter set of network} where An 1 (c)
The integer function {} and {} function must be operated
in such a way that the value becomes 0 or 1 else for m=1 the
value may go negative which does not make sense. rn only
changes with iteration. Equation (a) and (b) produce the
adaptiveness in parameters. Some sigmoid function and then
a binary operator must accompany them. However
{}function is strong and can be applied raw. {} depends
on parameters and can be named the evaluation function or
cost function of multiple parameters and each parameters
have unequal weightage.
Probability of movement Pij is given by

ALGORITHM
For a graph G = (V, E) having parameter set for each edge.
For each Batn n = 1 to k
Say Batn at any point of time is present at node i and
have option of j paths where j = 1, 2, 3,.., p where p is the
number of paths available.

(6)
where Aik is the returned echo signal for each combination
of path being analyzed.
Batn waits and listens to the loudness of the echo and
determines the path of travel by the following criteria
If 1 > {threshold}
If (sixth sense intensity) > (estimated result intensity)
Then follow sixth sense
Else
Then follow estimated result with path j for
max{Anj} and Anj > 0
End of if loop
Else
Then follow estimated result with path j for max{Anj}
and Anj > 0
End of if loop
where 0 1 1 is the probability of exploration. The sixth
sense criterion is followed for 1 > threshold times and
estimated result is followed (1- 1) > threshold times.
[Bat is a blind mammal but is provided with strong
sense of hearing and analysis of sound signal and we
consider them having a sixth sense. Now when they move
and analyze the search space, they keep on doing this
analysis until they hit upon the destination. In that case they
are bias to two kinds of calls, one from inner sixth sense
with probability 1 and another from the analysis with a
probability (1 - 1). These two kinds of calls will actually
imbibe the opportunity for both exploitation and
exploration. Sixth sense comes into play arbitrarily and can
be compared to the traditional mutation phenomenon of
many other nature inspired heuristics. Sixth sense intensity
comes into play through the random choice of path for
forward movement of bats.]
Batn reaches destination and shouts with An = 0. Even
if the iteration occurs because of the other bats, that bat will
not consider any negative value for An and hence literally
the processing stops there.
End of For Loop

Figure 1: Example to show the significance of the parameters rn , mn and An

Batn shouts with pulse rate (rn , mn) and loudness An.
[Here rn is the base signal which denotes degree of
analysis of the graph. This notation actually denotes the
degree of nodes the sound signal will be able to investigate.
Like if it is 1 then the signal will only investigate the
adjacent nodes and if it is 2 then the echo will reach the
adjacent of the adjacent nodes and likewise. Such scheme
will enhance the power of the signal and depends on the bat
and the situation and position in the graph network. mn is
the modulation signal which specifies number of different
paths from the available ones it will choose and depends on
the processing capacity of the bat. Say if there are p
different paths then mn p set} and mn {p set}. It is
generated randomly and depends on the program and its
complexity. It is needless to mention that it involves space
and complexity. Now the number of paths available paths,
which makes it clear that the number of chosen path for
investigation may be less and depends on probability of the
algorithm or the willingness of the bath. But once the
investigation is complete the bat chooses the best path and
moves on without further delay or analysis. Now the
loudness parameter is the estimation parameter which
actually provides how well the path is. The path parameters
gradually fade away the loudness according to their
importance and it depends on what parametric optimization
it is seeking. The loudness must be a large value so that the
fading away do not land up the loudness in the negative
zone. Negative loudness can be harmful which will be seen
later in the algorithm. The following example will make the
model clear and how the parameters are utilized. The bat
moves only on the output of these three parameters.]
The shout signal moves around the search space
The shout signal parameters involves in fading due to
a function of network parameters.

122

B. Weibull Coded Binary Bat Algorithm (WCBBA)

The following algorithm is another binary bat algorithm
which is using the Weibull Cumulative Distribution
Function for adaptation and discrete property.
ALGORITHM
A graph G = (V, E) is defined with parameter set for each
edge.
For each Bat n = 1 to k
Batn starts to move in the network
The frequency and velocity of the bat is given by the
equation (1) and (2) and are varied with the value of .
Now the position vector is replaced by binary mapping
function given by equation (7) and (8). Here the S{}
function is a Weibull Cumulative Distribution Function and
will lie between 0 and 1. And accordingly settling the as a
random value between 0 and 1, the binary equation (8)
works producing 0 and 1 stochastically.

parameter will vary the output of the equation and may help
in severe local investigation criteria and thus accelerate the
solution finding process for numerical optimization in
continuous domain and may be seen as a feedback
component of the system.
V.

METHODS AND ALGORITHMS

In this section we have provided the pseudo code for Real

BA for a road network graph for the analysis of the different
aspects of the road network.
A. BA FOR OPTIMIZED ROUTE SEARCH
The following pseudo code briefly describes the steps
involved in the algorithm for simulation.
Step 1: Initialize network graph G = (V,E) and its parameter
matrix {p1 , p2, , pk } with k parameters, here k = 2.
Step 2: Initialize N bats with its path memory and
component for investigation. Initialize the fitness (Total
time = Travelling time + Waiting time) matrix for each bat.
Step 3: Each Batn shouts with pulse rate (rn, mn) and
loudness An.
Step 4: The shout signal moves around the search space.
Step 5: The shout signal parameters involves in fading due
to a function of network parameters.
Step 6: Batn waits and listens to the loudness of the echo
and determines the path of travel according to the
investigation result criteria.
Step 7: Batn reaches destination and shouts with An = 0.
Step 8: For each bat at destination determine the fitness
Step 9: The best fitted bats path is the Global Best.
Step 10: The Global best path is provided for the guidance
of the vehicles.

(7)
(8)
where vij(t) is the velocity and the is the normalization
factor and is the power factor. is the randomly generated
threshold value and ~ [ 0, 1 ].
End of For Loop
C. Hybrid Real Binary Bat Algorithm
Real Bat Algorithm is a deterministic algorithm with
majority whereas Weibull Coded Binary Bat Algorithm is
fully stochastic. Hence the hybrid algorithm of the above
discussed algorithm can be a good example of combining
the deterministic and stochastic model. Equation (1), (2),
(6), (7) are kept as it is. Additionally we have introduced
two equations for binary generation.

VI.

COMPUTATIONAL RESULTS AND GRAPHS

From the plots (performed in Matlab 2011) shown in Figure

2-4 it is clearly depicted that RBA has well suited for the
discrete search space problems and the road network graph.

(9)
(10)
where 0 Phybrid 2 is the hybrid influenced factor and is
the randomly generated threshold value and ~ [ 0, 2 ]. 1
and 2 are the influencing factors.
IV.

MODIFIED ADAPTIVE BAT ALGORITHM

Now in the equation (1), (7), (8), (9) and (10) the factors ,
, , 1 and 2 can be varied using the following
mathematical equations which will gradually bring about the
adaptive component in the mathematical model. The factors
, , , 1 and 2 can be altered with i (with sign
generated randomly and i  {, , , 1 and 2}) and can be
made adaptive with the help of the fitness outcome like in
the following equations.

Figure 2: Variation of Global Best of Travelling Time for all Iterations

Also according to the time model framed the computational

results has produced acceptable variation in the delay
parameter when it is considered against the overall least
delay path. So overall the new bat algorithm has the
potential for the discrete graph based problems and can be
used for any multi-objective kind of graph based

(11)
where Fi is the fitness function and the is the constant to
vary the i for the different variables. The variation in the

123

investigation. BA is partly deterministic and partly

probabilistic (required for combined exploration and
exploitation) and the convergence rate compared with ACO
and IWD is competitive. BAT in figure represents the Real
BA.

whether the solutions found out really help in achieving the

expected result and how frequent the data are changing, or
can we formulate the change and develop a model which
can predict the change in the near future?
REFERENCE
[1]
[2]

[3]

[4]

Figure 3: Variation of Global Best of Waiting Time for all Iterations

[5]

[6]

[7]

[8]

Figure 4: Variation of Global Best of Total Time for all Iterations

VII. CONCLUSION & FUTURE WORKS

[9]

In this work we have discussed new discrete versions of

BA exclusively for the graph based problems for the first
time and used for route determination in a graph network.
We have also showed the way of how to make the
algorithmic parameters dynamic and adaptive which can be
used for variation based continuous domain numerical
optimization problems.
There are lot of opportunity in the development of types
of bat algorithm through the variation of different kind of
parameters it offers and also the algorithm will take
different shape when the problem environment changes.
Like many other nature inspired meta-heuristic bat
algorithm is also capable in solving combinatorial
optimization problem and also NP hard problems which are
difficult to solve with algorithms. However it readily suits
the continuous search space problem. Several parameters
describe the bat algorithm mathematical equations and each
has its own significance. Hence variations of those
parameters and introducing adaptive formulation may bring
about considerable changes in the convergence of the
algorithm. In road networks the dynamic parameters are
subjected to change and it is very important to seek out

[10]

[11]

[12]

[13]

[14]

[15]

124

Yang, X.-S.: 2011, Bat algorithm for multi-objective optimization,

International Journal of Bio-Inspired Computation 3(5), 267-274.
X. S. Yang, A New Metaheuristic Bat-Inspired Algorithm, Nature
Inspired Cooperative Strategies for Optimization (NISCO 2010) (Eds.
J. R. Gonzalez et al.), Studies in Computational Intelligence, Springer
Berlin, 284, Springer, 65-74 (2010).
Musikapun, P. and Pongcharoen, P.: 2012, Solving multi-stage
multi-machine multi-product scheduling problem using bat
algorithm, International Conference on Management and Artificial
Intelligence, Vol. 35, IACSIT Press, pp. 98-102.
Nakamura, R. Y. M., Pereira, L. A. M., da Costa, K.A. P., Rodrigues,
D., Papa, J. P. and Yang, X.-S.:2012, BBA: A binary bat algorithm
for feature selection, in C. M. D. S. Freitas, S. Sarkar, R. Scopigno
and L. Silva (eds), Conference on Graphics, Patterns and Images,
IEEE Computer Society Conference Publishing Services.
Ruiz-Vanoye, J. A., Daz-Parra, O., Cocn, F., Soto, A., los ngeles
Buenabad Arias, M. D., Verduzco Reyes, G. and Alberto-Lira, R.:
2012, Meta-heuristics algorithms based on the grouping of animals
by social behavior for the traveling salesman problem, International
Journal of Combinatorial Optimization Problems and Informatics
3(3), 104-123.
Bora, T.C.; Coelho, L.S.; Lebensztajn, L.; , "Bat-Inspired
Optimization Approach for the Brushless DC Wheel Motor Problem,"
Magnetics, IEEE Transactions on , vol.48, no.2, pp.947-950, Feb.
2012
Kennedy, J.; Eberhart, R.C.; , "A discrete binary version of the
particle swarm algorithm," Systems, Man, and Cybernetics, 1997.
Computational Cybernetics and Simulation., 1997 IEEE International
Conference on , vol.5, no., pp.4104-4108 vol.5, 12-15 Oct 1997
M. Dorigo et L.M. Gambardella, Ant Colony System : A
Cooperative Learning Approach to the Traveling Salesman Problem,
IEEE Transactions on Evolutionary Computation, volume 1, numro
1, pages 53-66, 1997.
Shah-Hosseini, Hamed (2009). "The intelligent water drops
algorithm: a nature-inspired swarm-based optimization algorithm".
International Journal of Bio-Inspired Computation 1 (1/2): 7179.
A. H. Gandomi and A. H. Alavi, Krill Herd: a new bio-inspired
optimization algorithm, Communications in Nonlinear Science and
Numerical Simulation, vol. 17, no. 12, pp. 48314845, 2012.
Arulanand Natarajan, S. Subramanian, and K. Premalatha. 2012. A
comparative study of cuckoo search and bat algorithm for Bloom
filter optimization in spam filtering. Int. J. Bio-Inspired Comput. 4, 2
(June 2012), 89-99.
Nakamura, R. Y M; Pereira, L. A M; Costa, K. A.; Rodrigues, D.;
Papa, J. P.; Yang, X. -S, "BBA: A Binary Bat Algorithm for Feature
Selection," Graphics, Patterns and Images (SIBGRAPI), 2012 25th
SIBGRAPI Conference on , vol., no., pp.291,297, 22-25 Aug. 2012.
C. Sur, S. Sharma, A. Shukla, Analysis & Modeling Multi-Breeded
Mean-Minded Ant Colony Optimization of Agent Based Road
Vehicle Routing Management, 2012 International Conference for
Internet Technology and Secured Transactions (ICITST), Dec. 2012.
C. Sur, S. Sharma, A. Shukla, Solving Travelling Salesman Problem
Using Egyptian Vulture Optimization Algorithm A New Approach,
20th International Conference on Intelligent Information Systems,
(IIS 2013), vol. 7912, pp. 254267, 2013.
C. Sur, S. Sharma, A. Shukla, Egyptian Vulture Optimization
Algorithm A New Nature Inspired Meta-heuristics for Knapsack
Problem, The 9th International Conference on Computing and
Information Technology (IC2IT2013), vol. 209, pp. 227-237, 2013.