An ant-based algorithm for finding degree-constrained minimum spanning tree

A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spanning tree of minimum cost in an edge weighted graphis well known to be NP-hard. In this paper we give an Ant-Based algorithm for finding low cost degree-constrained spanning trees. Ants are used to identify a set of candidate edges from which a degree-constrained spanning tree can be constructed. Extensive experimental results show that the algorithm performs very well against other algorithms on a set of 572 problem instances.

[1]  Patrick R. McMullen,et al.  Swarm intelligence: power in numbers , 2002, CACM.

[2]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[3]  A. Volgenant.  A Lagrangean approach to the degree-constrained minimum spanning tree problem , 1989 .

[4]  Bryant A. Julstrom,et al.  Edge sets: an effective evolutionary coding of spanning trees , 2003, IEEE Trans. Evol. Comput..

[5]  Jano I. van Hemert,et al.  Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO , 2006, GECCO.

[6]  R. Ravi,et al.  Many birds with one stone: multi-objective approximation algorithms , 1993, STOC '93.

[7]  Thang Nguyen Bui,et al.  Finding Maximum Cliques with Distributed Ants , 2004, GECCO.

[8]  Andreas T. Ernst,et al.  Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree , 2001, J. Heuristics.

[9]  Bertrand M. T. Lin,et al.  Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem , 2003, J. Exp. Theor. Artif. Intell..

[10]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[11]  André Carlos Ponce de Leon Ferreira de Carvalho,et al.  Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design , 2004, GECCO.

[12]  Bryant A. Julstrom,et al.  A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem , 2000, SAC '00.

[13]  Byung Ro Moon,et al.  Genetic Algorithm and Graph Partitioning , 1996, IEEE Trans. Computers.

[14]  David W. Corne,et al.  A new evolutionary approach to the degree-constrained minimum spanning tree problem , 1999, IEEE Trans. Evol. Comput..

[15]  Marco Laumanns,et al.  A hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem , 2004, Hybrid Metaheuristics.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  David W. Corne,et al.  A Powerful New Encoding for Tree-Based Combinatorial Optimisation Problems , 2004, PPSN.

[18]  Narsingh Deo,et al.  Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine , 1996, Parallel Comput..

[19]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[20]  Mitsuo Gen,et al.  A note on genetic algorithms for degree-constrained spanning tree problems , 1997, Networks.

[21]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[22]  Subhash C. Narula,et al.  Degree-constrained minimum spanning tree , 1980, Comput. Oper. Res..

[23]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[24]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[25]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[26]  Gnanasekaran Sundarraj,et al.  Ant System for the k-Cardinality Tree Problem , 2004, GECCO.

[27]  Martin W. P. Savelsbergh,et al.  Edge exchanges in the degree-constrained minimum spanning tree problem , 1985, Comput. Oper. Res..

[28]  G. Raidl.  An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[29]  Temel Öncan,et al.  A tabu search heuristic for the generalized minimum spanning tree problem , 2008, Eur. J. Oper. Res..