An ant colony optimization approach to the degree-constrained minimum spanning tree problem

Authors:
Y. T. Bau;C. K. Ho;H. T. Ewe
Affiliations:
Faculty of Information Technology, Jalan Multimedia, Multimedia University, Cyberjaya, Selangor, Malaysia;Faculty of Information Technology, Jalan Multimedia, Multimedia University, Cyberjaya, Selangor, Malaysia;Faculty of Information Technology, Jalan Multimedia, Multimedia University, Cyberjaya, Selangor, Malaysia
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Year:
2005

Citing 4
Cited 1

The ant colony optimization meta-heuristic

New ideas in optimization
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree

Journal of Heuristics
A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
A new evolutionary approach to the degree-constrained minimumspanning tree problem

IEEE Transactions on Evolutionary Computation

Degree constrained minimum spanning tree problem: a learning automata approach

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the application of an Ant Colony Optimization (ACO) algorithm approach for communications networks design problem. We explore the use of ACO’s for solving a network optimization problem, the degree-constrained minimum spanning tree problem (d-MST), which is a NP-Hard problem. The effectiveness of the proposed algorithm is demonstrated through two kinds of data set: structured hard (SHRD) complete graphs and misleading (M-graph) complete graphs. Empirical results show that ACO performs competitively with other approaches based on evolutionary algorithm (EA) on certain instance set problem.