Академический Документы
Профессиональный Документы
Культура Документы
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
I.
INTRODUCTION
120
III.
(4)
(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
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
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.
(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.
(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.
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.
(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
[3]
[4]
[6]
[7]
[8]
[10]
[11]
[12]
[13]
[14]
[15]
124