A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems

2012 ◽  
Vol 39 (5) ◽  
pp. 5681-5686 ◽  
Author(s):  
Hideki Katagiri ◽  
Tomohiro Hayashida ◽  
Ichiro Nishizaki ◽  
Qingqiang Guo
Keyword(s):  
Tabu Search ◽  
Ant Colony Optimization ◽  
Spanning Tree ◽  
Hybrid Algorithm ◽  
Minimum Spanning Tree ◽  
Ant Colony

NEW METAHEURISTIC APPROACHES FOR THE LEAF-CONSTRAINED MINIMUM SPANNING TREE PROBLEM

2008 ◽  
Vol 25 (04) ◽  
pp. 575-589 ◽  
Author(s):  
ALOK SINGH ◽  
ANURAG SINGH BAGHEL
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Ant Colony Optimization ◽  
Spanning Tree ◽  
Spanning Trees ◽  
Minimum Spanning Tree ◽  
Weighted Graph ◽  
The Other ◽  
Greedy Heuristic ◽  
New Approaches

Given an undirected, connected, weighted graph, the leaf-constrained minimum spanning tree (LCMST) problem seeks a spanning tree of the graph with smallest weight among all spanning trees of the graph, which contains at least l leaves. In this paper we have proposed two new metaheuristic approaches for the LCMST problem. One is an ant-colony optimization (ACO) algorithm, whereas the other is a tabu search based algorithm. Similar to a previously proposed genetic algorithm, these metaheuristic approaches also use the subset coding that represents a leaf-constrained spanning tree by the set of its interior vertices. Our new approaches perform well in comparison with two best heuristics reported in the literature for the problem — the subset-coded genetic algorithm and a greedy heuristic.

Sign in / Sign up

Export Citation Format

Share Document