Ant Colony Optimization approaches to the degree-constrained minimum spanning tree problem
This paper presents the design of two Ant Colony Optimization (ACO) approaches and their improved variants on the degree-constrained minimum spanning tree (d-MST) problem. The first approach, which we call p-ACO, uses the vertices of the construction graph as solution components, and is motivated by...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
JISE
2008
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/2295/ http://shdl.mmu.edu.my/2295/1/Ant%20Colony%20Optimization%20Approaches.pdf |