Ant colony optimization approaches to the degree-constrained minimum spanning tree problem

Journal of Information Science and Engineering

Volumn 24, Issue 4, 2008, Pages 1081-1094

  Bau, Yoon Teck ^a   Ho, Chin Kuan ^a   Ewe, Hong Tat ^a  

^a MULTIMEDIA UNIVERSITY   (Malaysia)

Author keywords

Ant colony optimization; Degree constrained minimum spanning tree; Kruskal; Metaheuristic; Np hard; Prim; Swarm intelligence

Indexed keywords

ALGORITHMS; ANNEALING; CONSTRAINED OPTIMIZATION; GRAPH THEORY; OPTIMIZATION; QUERY PROCESSING; SET THEORY; SIMULATED ANNEALING; TREES (MATHEMATICS);

ANT COLONY OPTIMIZATION; BRANCH AND BOUND; DATA SETS; DEGREE-CONSTRAINED MINIMUM SPANNING TREE; EMPIRICAL EVALUATIONS; EMPIRICAL RESULTS; GRAPH EDGES; KRUSKAL; METAHEURISTIC; MST PROBLEM; NP-HARD; PRIM; PRIM'S ALGORITHM; PROBLEM INSTANCES; SEARCH SPACES; SET REPRESENTATION; SOLUTION COMPONENTS; SWARM INTELLIGENCE; TOURNAMENT SELECTION;

EVOLUTIONARY ALGORITHMS;

EID: 48849098462     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. M. Dorigo and T. Stützle, "The ant colony optimization metaheuristic: algorithms, applications, and advances," F. Glover and G.A. Kochenberger, eds., Handbook of Metaheuristics, Kluwer Academic Publishers, 2003, pp. 250-285.
2. M. Krishnamoorthy, A. T. Ernst, and Y. M. Sharaiha, "Comparison of algorithms for the degree constrained minimum spanning tree," Journal of Heuristics, Vol. 7, 2001, pp. 587-611.
3. N. Deo and S. L. Hakimi, "The shortest generalized Hamiltonian tree," in Proceeding of the 6th Annual Allerton Conference, 1968, pp. 879-888.
4. Y. T. Bau, C. K. Ho, and H. T. Ewe, "An ant colony optimization approach to the degree-constrained minimum spanning tree problem," Lecture Notes Artificial Intelligence, Vol. 3801, 2005, pp. 657-662.
5. T. N. Bui and C. M. Zrncic, "An ant-based algorithm for finding degree-constrained minimum spanning tree," in Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, 2006, pp. 11-18.
6. S. M. Soak, D. Corne, and B. H. Ahn, "A new encoding for the degree constrained minimum spanning tree problem," Lecture Notes Artificial Intelligence, Vol. 3213, 2004, pp. 952-958.
7. J. Knowles and D. Corne, "A new evolutionary approach to the degree-constrained minimum spanning tree problem," IEEE Transactions on Evolutionary Computation, Vol. 4, 2000, pp. 125-134.
8. G. R. Raidl, "An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem," IEEE Transactions on Evolutionary Computation, Vol. 1, 2000, pp. 104-111.
9. G. R. Raidl and B. A. Julstrom, "A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem," in Proceedings of the ACM Symposium on Applied Computing, 2000, pp. 440-445.
10. G. Zhou, M. Gen, and T. Wu, "A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm," in Proceedings of the International Conference on System, Man, and Cybernetics, Vol. 4, 1996, pp. 2683-2688.
11. G. Zhou and M. Gen, "Approach to the degree-constrained minimum spanning tree problem using genetic algorithm," Engineering Design and Automation, Vol. 3, 1997, pp. 228-231.
12. A. Volgenant, "A lagrangean approach to the degree-constrained minimum spanning tree problem," European Journal of Operational Research, Vol. 39, 1989, pp. 325-331.
13. L. J. Mao, N. Deo, and S. D. Lang, "A parallel algorithm for the degree-constrained minimum spanning tree problem using nearest-neighbor chains," in Proceedings of the 4th International Symposium on Parallel Architectures, Algorithms, and Networks, 1999, pp. 184-189.
14. C. C. Ribeiro and M. C. Souza, "Variable neighborhood search for the degree-constrained minimum spanning tree problem," Discrete Applied Mathematics, Vol. 118, 2002, pp. 43-54.
15. C. Monma and S. Suri, "Transitions in geometric minimum spanning trees," Discrete and Computational Geometry, Vol. 8, 1992, pp. 265-293.
16. M. Reimann and M. Laumanns, "Savings based ant colony optimization for capacitated minimum spanning tree problem," Computers & Operations Research, Vol. 33, 2006, pp. 1794-1822.
17. S. J. Shyu, P. Y. Yin, B. M. T. Lin, and M. Haouari, "Ant-tree: an ant colony optimization approach to the generalized minimum spanning tree problem," Journal of Experimental and Theoretical Artificial Intelligence, Vol. 15, 2003, pp. 103-112.
18. J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," in Proceedings of the American Mathematics Society, Vol. 7, 1956, pp. 48-50.
19. R. Prim, "Shortest connection networks and some generalizations, " Bell System Technical Journal, Vol. 36, 1957, pp. 1389-1401.
20. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms 2nd ed., The MIT Press, 2001.
21. M. Dorigo and L. M. Gambardella, "Ant colony system: a cooperative learning approach to the traveling salesman problem," IEEE Transactions on Evolutionary Computation, Vol. 1, 1997, pp. 53-66.
22. M. Dorigo, V. Maniezzo, and A. Colorni, "The ant system: optimization by a colony of cooperating agents," IEEE Transactions on Systems, Man, and Cybernetics - Part B, Vol. 26, 1996, pp. 29-41.
23. M. Mitchell, An Introduction to Genetic Algorithms, The MIT Press, 1999.
24. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd revised and extended ed., Springer Verlag, 1996.
25. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.
26. T. Stützle and H. H. Hoos, "MAX-MIN ant system," Journal of Future Generation Computer Systems, Vol. 16, 2000, pp. 889-914.