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

Ewe, HT and Ho, , CK and Bau, , YT (2005) An ant colony optimization approach to the degree-constrained minimum spanning tree problem. COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 1, PROCEEDINGS, 3801 . pp. 657-662. ISSN 0302-9743

Full text not available from this repository.

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.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Computing and Informatics (FCI)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 24 Aug 2011 06:12
Last Modified: 24 Aug 2011 06:12
URI: http://shdl.mmu.edu.my/id/eprint/2300

Actions (login required)

View Item View Item