(IJCNS) International Journal of Computer and Network Security, 103

Vol. 2, No. 2, February 2010

Integration of Metaheuristic Algorithms for

Minimum Spanning Tree
R.Thamilselvan1, Dr.P.Balasubramanie2
1
Assistant Professor, Department of Computer Science and Engineering,
Kongu Engineering College, Perundurai, Erode 638 052, Tamilnadu, India
r_thamilselvan@yahoo.co.in
2
Professor, Department of Computer Science and Engineering,
Kongu Engineering College, Perundurai, Erode 638 052, Tamilnadu, India
pbalu_20032001@yahoo.co.in

minimum spanning tree algorithm [10] is shown in table 1

Abstract: This paper presents a new algorithm based on
integrating Tabu Search (TS), Simulated Annealing (SA) and
Genetic Algorithms (GA) for solving minimum spanning tree A
problem. This proposed integration method is a general kind of 7
solution method that orchestrates the interaction between local 2 2
improvement procedures and higher level strategies to create a 5 4 D 5
process that is capable of escaping from local optima and B
O T
performing a robust search of a feasible region. This paper 4 1 3 1
applies Tabu Search, Simulated Annealing and Genetic 7
algorithm for minimum spanning tree problem and compares C 4
the results obtained by each. With the implementation of our E
approach the minimum spanning tree problem is solved with
feasible solution.
Figure 1. Network with nodes are connected
Keywords: Tabu Search, Simulated Annealing, Genetic
Algorithm, Minimum Spanning Tree. Table 1: Algorithm for Minimum Spanning Tree

1. Introduction 1. Select a node arbitrarily, and then connect it.

There are two cases in minimum spanning tree [12], an
undirected and connected network is being considered,
where the given information includes some measure of the
positive length (distance, cost, time etc.) associated with
each link. The problem has to choosing a set of links that
have the shortest total length among all sets of links that
satisfy a certain property. For the minimum spanning tree
problem, the required property is that the chosen links must
provide a path between each pair of nodes. The minimum
spanning tree problem can be summarized as follows.
i. There are set of nodes of a network but not the links.
Instead, you are given the potential links and the
positive length for each if it is inserted into the
network.
ii. To design the network by inserting enough links to
satisfy the requirement that there be a path between
every pair of nodes.
iii. The objective is to satisfy this requirement in a way
that minimizes the total length of the links inserted
into the network.
A network with n nodes required (n-1) links to provide a
path between each pair of nodes. No extra links should be
used, since this would needlessly increase the total length of
the chosen links. The links need to be chosen in such a way
that the resulting network forms a spanning tree. The basic
2. Identify the unconnected node that is closest to a
connected node, and then connect these two nodes.
Repeat this step until all nodes have been connected.
3. Tie breaking: Ties for the nearest distinct node or
the closest unconnected node may be broken
arbitrarily, and the algorithm must still yield an
optimal solution.
To apply the algorithm in Table 1 to the Network in
Figure 1. Keep the arbitrarily select node O to start. The
unconnected node closest to node O is node A. Connect
node A to node O. Repeat the algorithm, then we will get
the spanning tree in Figure 2.
A
2 2
D 5
B
O T
1 3 1
C
E
Figure 2. Minimum Spanning Tree
The minimum spanning tree problem is the one
problem that falls into the broad category of network design.
104 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 2, February 2010

2. Related Work constraints must be observed when choosing the links to

include in the network.
2.1 Tabu Search
Constraint 1: Link AD can be included only if link DE also
Tabu Search [1] [2] is a widely used metaheuristic that included.
uses some common sense ideas to enable the search process
to escape from a local optimum. Any application of tabu Constraint 2: At most one of the three links AD, CD and
search includes as a subroutine a local search procedure that AB can be included.
seems appropriate for the problem being addressed. The To take the constraint into account is to charge a huge
process begins by using this procedure as a local penalty, such as charge a penalty of 100 if constraint 1 is
improvement procedure in the usual way to find a local violated and charge a penalty of 100 if two of the three links
optimum. A key strategy of tabu search is that is then specified in constraint 2 are included.
continues the search by allowing non improving moves to
the best solutions in the neighborhood of the local optimum.
Once the point is reached where better solutions can be B
found in the neighborhood of the current trial solution, the
local improvement procedure is reapplied to find a new local 30 30
optimum. The danger with this approach is that after
moving away from a local optimum, the process will cycle 10 5
A C E
right back to the same local optimum. A tabu list records
these forbidden moves, which are referred to as tabu moves.
25
2.1.1 Basic Tabu Search Algorithm 15 40
Initialization: Start with a feasible initial trial solution D

Iteration: Use an appropriate local search procedure to

define the feasible moves into the local neighborhood [5] of
the current trial solution. Eliminate from consideration any
move on the current tabu list unless that move would result
in a better solution than the best trial solution found so far.
Determine which of the remaining moves provides the best
solution. Adopt this solution as the next trial solution,
regardless of whether it is better or worse than the current
trial solution. Update the tabu list to forbid cycling back to
what has been the current trial solution. If the tabu list
already had been full, delete the oldest member of the tabu
list to provide more flexibility for future moves.
Stopping rule: Use some stopping criterion, such as a
fixed number of iterations [7], a fixed amount of CPU time,
or a fixed number of consecutive iterations without an
improvement in the best objective function value. Also stop
at any iteration where there are no feasible moves into the
neighborhood of the current trial solution. Accept the best
trial solution found on any iteration as the final solution.
The basic idea behind tabu search is that, adding short-term
memory to local search, improves its ability to locate optimal
solutions. It is an is an iterative search that starts from some
initial feasible solution [8] and attempts to determine the best
solution in the manner of a hill-climbing algorithm.
2.1.2 A Minimum Spanning Tree Problem with
Constraints
Figure 3 shows a network with five nodes, where the
dashed lines represent the potential links that could be
inserted into the network and the number next to each
dashed line represents the cost associated with inserting that
particular link. Thus, the problem is to determine which
four of these links should be inserted into the network to
minimize the total cost of these links. The following
Figure 3. Data for a Minimum Spanning Tree before
choosing the links to be included in the network
B
30 30
10 5
A C E
25
15 D 40
Figure 4. Optimal solution for a Minimum Spanning
Tree
The Figure 4 shows the desired minimum spanning tree,
where the dark lines represent the links that have been
inserted into the network with a total cost of 50. This
optimal solution [8] is obtained by the greedy algorithm.
The method to conduct tabu search is follows.
Local Search Procedure: At each iteration, choose the best
immediate neighbor [6] of the current trial solution that is
not ruled out by its tabu status.
Neighborhood structure: An immediate neighbor of the
current trial solution is one that is reached by adding a
single link and then deleting one of the other links in the
cycle that is formed by the addition of this link.
Form of tabu moves: List the links that should not be
deleted
Addition of tabu move: At each iteration, after choosing
the link to be added to the network, also add this link to the
tabu list.
 (IJCNS) International Journal of Computer and Network Security, 105
Vol. 2, No. 2, February 2010

Maximum size of tabu list: Two Add link BE to the network shown in Figure 5, the
automatically place this added link on the tabu list. Delete
Stooping rule: Stop after three consecutive iterations
link AB from the network shown in Figure 5. Various
without an improvement in the best objective function value.
options for adding a link and deleting a link in iteration 2
In Figure 4 both constraints are violates, so that penalties of are shown in Table 3.
100 need to be imposed twice. Therefore the total cost of
Table 3: The options for adding a link and deleting another
this solution is
link in iteration 2
Cost = 20+10+5+15+200 = 250
Add Delete Cost
Iteration 1: There are three options for adding a link to the AD DE (Tabu move)
network in Figure 4 are BE, CD and DE. If BE were to be AD CD 85+100=185
chosen, the cycle formed, so the three options for deleting a AD AC 80+100=180
link would be CE, AC and AB. If CE were to be deleted, the BE CE 100+0=100
change in the cost would be 30-5=25 with no change in the BE AC 95+0=95
constraint penalties, so the total cost would increase from BE AB 85+0=85 (Minimum)
250 to 275. So that iteration 1 is followed as per Table 2. CD DE 60+100=160
CD DE 95+100=195
Table 2: The options for adding a link and deleting another
link in iteration 1 Iteration 3: The following are the decisions are made in
this iteration.
Add Delete Cost
BE CE 75+200=275 Add a link CD to the network shown in Figure 6, and then
BE AC 70+200=270 automatically place this added link on the tabu list. Delete
BE AB 60+100=160 link DE from the network shown in Figure 6. Various
CD AD 60+100=160 options for adding a link and deleting a link in iteration 3
CD AC 65+300=365 are shown in Table 4.
DE CE 85+100=185
DE AC 80+100=180 B
DE AD 75+0=75 (Minimum)
30 30
The final output of the iteration 1 in a network is shown in
Figure 5. 10 5
A C E
B
25
30 30 15 40
D
A 10 C 5 E
Figure 7. Modified network after Iteration 3 with optimal
solution cost=70
25
15 40 Table 4: The options for adding a link and deleting another
D link in iteration 3
Figure 5. Modified network after Iteration 1 with new Add Delete Cost
cost=75
Iteration 2: In the second iteration the following decisions AB BE (Tabu move)
are made. AB CE 100+0=100
AB AC 95+0=95
B AD DE 60+100=160
AD CE 95+0=95
30 30 AD AC 90+0=90
CD DE 70+0=70 (optimal solution
10 5 CD CE 105+0=105
A C E
With a well designed tabu search algorithm, the best trial
solution found in Figure 7 after the algorithm has run a
25
modest number of iterations is likely to be a good feasible
15 40
D solution. It might even be an optimal solution [1], [2] but no
such guarantee can be given. Selecting a stopping rule that
Figure 6. Modified network after Iteration 2 with new provides a relatively long run of the algorithm increases the
cost=85 chance of reaching the global optimum.
106
2.2 Simulated Annealing
Simulated annealing [1]-[5] is another widely used
metaheuritic that enables the search process to escape from
a local optimum. Each iteration of the simulated annealing
search process moves from the current trial solution to an
immediate neighbor in the local neighborhood of this
solution, just as for tabu search. However, the difference
from tabu search lies in how an immediate neighbor is
selected to be the next trial solution. Let
Zc = objective function value for the current trial solution
Zn = objective function value for the current candidate to be
the next trial solution.
T = a parameter that measures the tendency to accept the
current candidate to be the next trial solution if this
candidate is not an improvement on the current trial
solution.
The rule for selecting which immediate neighbor will be the
next trial solution is the following.
Move Selection rule: Among all the immediate neighbors
of the current trial solution [9], select one randomly to
become the current candidate to be the next trial solution.
Assuming the objective is maximization of the objective
function, accept or reject this candidate to be the next trial
solution as follows:
If Zn ≤ Zc, always accept this candidate
If Zn < Zc, accept the candidate with the following
probability
Zn − Zc
Prof {acceptance} = e where x =
x
T solve the minimum spanning tree problem. The core of the
2.2.1 Basic Simulated Annealing Algorithm
Initialization: Start with a feasible initial trial solution.
Iteration: Use to move selection rule to select the next
trial solution.
Check the temperature schedule: When the desired
number of iterations has been performed at the current value
of T, decrease T to the next value in the temperature
schedule and resume performing iterations at this next
value.
Stopping rule: When the desired number of iterations
have been performed at the smallest value of T in the
temperature schedule as final solution.
2.3 Genetic Algorithms
Genetic algorithms [1]-[3] provide a third type of
metaheuristic that is quite different from first two. This type
tends to be particularly effective at exploring various parts
of the feasible region and gradually evolving toward the best
feasible solutions. The modern field of genetics provides a
further explanation of this process of evolution and the
natural selection involved in the survival of the fittest. In
any species that reproduces by sexual reproduction, each
offspring inherits some of the chromosomes from each of
the two parents, where the genes within the chromosomes
determine the individual features of the child. A child who
(IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 2, February 2010
happens to inherit the better features of the parents is
slightly more likely to survive into adulthood and then
become a parent who passes on some of these features to the
next generation. The population tends to improve slowly
over time by this process. A second factor that contributes to
this process is a random, low-level mutation rate in the
DNA of the chromosomes. Thus, a mutation occasionally
occurs that changes the features of a chromosome that a
child inherits from a parent.
2.3.1 Basic Genetic Algorithm
Initialization: Start with an initial population of feasible
trial solutions, perhaps by generation then randomly.
Iteration: Use a random process [5] that is biased toward
the more fit members of the current population to select
some of the members to become parents. Pair up the parents
randomly and then have each pair of parents give birth to
two children whose features are a random mixture [10] of
the features of the parents, except for occasional mutations.
Evaluate the fitness for each new member in the new
population.
Stopping rule: Use some stopping rule, such as a fixed
number of iterations, a fixed amount of CPU time, or a fixed
number of consecutive iterations without any improvement
in the best trial solution found so far. Use the best trial
solution fond on any iteration as the final solution.
3. Proposed Work
The new algorithm based on integrating genetic
algorithms, tabu search and simulated annealing methods to
proposed algorithm is based on tabu search algorithms.
Genetic algorithm is used to generate new population
members in the reproduction phase of the tabu search
algorithm. Simulated annealing method is used to accelerate
the convergence of the tabu search algorithm by applying
the simulated annealing test for all the population members.
A new implementation of the tabu search algorithm is
introduced. In the genetic algorithm part of the proposed
algorithm, a simple short-term memory procedure is used to
counter the danger of entrapment at a local optimum, and
the premature convergence of the tabu search algorithm. A
simple cooling schedule has been implemented to apply the
simulated annealing test in the algorithm [3]-[5].
3.1 Basic Integration Algorithm
Initialization: Start with a feasible trial solution.
Iteration: Use an appropriate local search procedure to
define the feasible moves into the local neighborhood [6] of
the current trial solution. Determine which of the remaining
moves provides the best solution. At the same time Use the
move selection rule to select the next trial solution. For each
iteration invoke the algorithm to test the cycles in a graph.
Stopping rule: If a pre-defined termination condition
is satisfied, output Best Solution and exit.
3.1.1 Algorithm for testing Cycles
 (IJCNS) International Journal of Computer and Network Security, 107
Vol. 2, No. 2, February 2010

Step 1: From the combination of edges and incidence
matrix, obtain degree of each node contributed by the edges
under consideration.
Step 2: Test whether at least two nodes of degree one? If
not, go to step 6. Otherwise continue.
Step 3: Test whether at least three nodes of degree more
than one? If not go to step 5.
Step 4: Delete pendant edges, if exists of n-1 edges and
modify the degree of the modes accordingly and go to step 2.
Otherwise go to step 6.

Table 6: Comparisons of TS, GA, SA and Integration Algorithm for Spanning Tree
Graph TS GTA SA Integration Algorithm
size (No.
of Time(s) Cost Iteration Time(s) Cost Iteration Time(s) Cost Iteration Time(s) Cost Iteration
Nodes)
5 50 75 3 52 75 3 55 75 4 50 75 2
7 55 80 3 54 80 4 55 80 4 48 80 2
9 58 95 3 57 90 3 60 90 4 52 90 2
11 65 100 4 68 100 3 75 110 5 60 95 1
13 70 120 4 75 120 4 78 120 5 60 115 1

Figure 8. Comparisons of TS, GA, SA and Integration Algorithm for Spanning Tree

Step 5: Edge combinations are tree. The final output of the iteration 1 in a network is shown in
Step 6: Stop. Figure 9. Well defined tabu search algorithm [2], the best
trial solution found after the algorithm has run a modest
Iteration 1: Instead of charge a penalty for the constraint,
the constraint should be verified for every change in the number of iterations is likely to be a good feasible solution
graph. There are three options for adding a link to the [8]. But the integration algorithm found the feasible solution
network in Figure 4 are CD, DE and DE. If CD were to be in only little iteration from the starting.
chosen, the cycle formed, so the two options for deleting a
link would be AD and AC. If AD is added then AB should B
be deleted according to the second constraint. So that for
connecting B, BE should be added. So that iteration 1 is 30 30
followed as per Table 5.
10 5
Table 5: The options for adding a link and deleting another A C E
link in iteration 1
25
Add Delete Cost 15 40
D
BE CE 75
BE AC 70
Figure 9. Modified network after Iteration 1 with new
BE AB 60
Constraints violated. cost=70
CD AD 60
CD AC 65
CD AB 70 4. Experiments and Results
DE CE 85 Five testing graphs of the size 5, 7,9,11 and 13 nodes. All
DE AC 80 Constraints violated.
the five graphs are generating a parse tree using tabu search,
genetic algorithm, simulated annealing and integration
108 (IJCNS) International Journal of Computer and Network Security,
algorithm. All the algorithm were stopped when the
solutions
did not change over a fixed number of iterations. The
relative performance between TS, GTA, SA and Integration
algorithm for the minimum spanning tree problem is given
in Table 6 and Figure 8. Five trials were taken on each
graph and the average value of the cost and time in
milliseconds are tabulated in each case. It is evident from
the table that Integration algorithm performed very well as
the problem size increased and showed superliner speedups
at higher problem sizes.
5. Conclusion and Future Work
In this paper, we have implemented an integration of
all the three metaheuristics [5] algorithms for minimum
spanning tree problem. In this approach, a pre-defined
number of starting solutions are chosen from widely
separated regions in the sample space, and used in
local search procedures to obtain a set of locally optimal
solutions. These locally optimal solutions [9] [10] are
then examined to provide an idea about the probability
of each vertex being included in an optimal solution
to the instance. Using these ideas, the neighborhood
of each solution is searched in a probabilistic manner,
such that the moves excluding vertices that have a
high probability of being in an optimal solution or of
including vertices that have a low probability of being
in an optimal solution are discouraged. Experiment
result shows that the integration of metaheuristics
provides a feasible solution [11] if the numbers of nodes
are increased in a graph. In future based on this result
this may be extended for feasible dynamic routing in a
network.
References
[1] R.Thamilselvan and Dr.P. Balasubramanie, “A Genetic
Algorithm with a Tabu Search (GTA) for Travelling
Salesman Problem”. International Journal of Recent
Trends in Engineering, Issue. 1, Vol. 1, pp. 607-610,
June 2009.
[2] R.Thamilselvan and Dr.P. Balasubramanie,
“Integrating Genetic Algorithm, Tabu Search
Approach for Job Shop Scheduling” International
Journal of Computer Science and Information
Security, Vol. 2, No.1, pp. 134-139, 2009
[3] Jingjing Zhang, Yaohui Jin and Wsisheng Hu, “A
Genetic Algorithm for Smooth Scheduling in Slotted
WDM Network”, International Journal of Information
Technology, Vo. 12, No. 6, pp.26-34, 2006.
[4] S.Jayalakshmi and S.P. Rajagopalan, “Modular
Simulated Annealing in Classical Job Shop
Scheduling”, International Journal of Information
Technology, Vol. 6, No.2, pp. 222-226, 2007.
[5] N.K.Cauvery and Dr. K.V Viswanatha, “Routing in
Dynamic Network using Ants and Genetic
Algorithm”, International Journal of Computer
Science and Network Security, Vol. 9, No. 3, pp. 194-
200, March 2009.
[6] Van Laarhoven, P.J.M., E.H.L., AArts, and Jan Karel
Lenstra, “Job Shop Scheduling by Simulated
Vol. 2, No. 2, February 2010
Annealing”, Operation Research, Vol. 40, pp. 113-
125, 1992.
[7] K. Aggarwal and R. D. Kent, “An Adaptive
Generalized Scheduler for Grid Applications”, in
Proc. of the 19th Annual International Symposium on
High Performance Computing Systems and
Applications (HPCS’05), pp.15-18, Guelph, Ontario
Canada, May 2005.
[8] Anant Oonsivilai, Wichai Srisuruk, Boonuruang
Marungsri and Thanatchai Kulworawanichpong,
“Tabu Search Approach to Solve Routing Issues in
Communication Networks”, World Academy of
Science, Engineering and Technology, pp. 1174-
1177, 2009.
[9] D.Janaki Ram, T.H.Steenivas and K.Ganapathy
Subramaniam, “Parallel Simulated Annealing
Algorithms”, International journal of Parallel and
Distributed Computing, Vol.37,pp. 207-212, 1996.
[10] D.Janakiram, “Grid Computing”, A Research
Monograph, Tata McGraw-Hill Publishing Company
Limited, 2005.
[11] Bernard Chazelle, “A Minimum Spanning Tree
Algorithm with Inverse Ackermann Type
Complexity”, Journal of the ACM, 47(6), pp. 1028-
1047, 2000.
[12] Sanjay Kumar Pal, “Renovation of Minimum
Spanning Tree Algorithms of Weighted Graph”,
Journal of ACM Ubiquity, Vol.9, Issue 7, pp. 1-5,
2008.
[13] Greening, Daniel R., “Parallel Simulated Annealing
Techniques”, Physica D, Vol.42, pp. 293-306,1990.
[14] Van Laarhoven, P.J.M., E.H.L., AArts, and Jan Karel
Lenstra, “Job Shop Scheduling by Simulated Annealing”,
Operation Research, Vol. 40, pp. 113-125, 1992.
Authors Profile
R.Thamilselvan is an Assistant Professor in the department of
computer Science and Engineering, Kongu Engineering College,
Perundurai, Tamilnadu India. He has completed his M.E Computer
Science and Engineering in 2005 under Anna University Chennai.
He has completed 8 years of teaching service. He has published 3
papers in national conference and 2 paper in International Journal.
He was the recipient of the Best Faculty award during the year
2007-2008. His area of interest includes Grid Computing, Parallel
Processing, and Distributed Computing. He has organized 2
national level seminar sponsored by AICTE, New Delhi.
Dr.P.Balasubramanie is a Professor in the department of
computer Science and Engineering, Kongu Engineering College,
Perundurai, Tamilnadu India. He was awarded junior research
Fellowship by Council of Scientific and Industrial Research
(CSIR) in 1990 and he has completed his Ph.D degree in 1990
under Anna University in 1996. He has also qualified for the state
Level Eligibility test for Lectureship in 1990. He has completed 13
years of teaching service. He has published more than 60 articles
in International/National Journals. He has authored six books with
the reputed publishers. He was the recipient of the Best Faculty
award for consecutively two years. He is also the recipient of the
CTS Best Faculty Award- 2008. He has guided 3 Ph.D scholars
and 23 research scholars are working under his guidance. His area
of interest includes Image processing, data mining, networking and
so on. He is a member of Board of studies, Anna University
Coimbatore. He has organized several seminar/workshops.