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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3801 LNAI, Issue , 2005, Pages 657-662

  Bau, Y T ^a   Ho, C K ^a   Ewe, H T ^a  

^a MULTIMEDIA UNIVERSITY   (Malaysia)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTER NETWORKS; DATABASE SYSTEMS; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

ANT COLONY OPTIMIZATION; COMMUNICATIONS NETWORKS; EVOLUTIONARY ALGORITHM; SPANNING TREE PROBLEM;

ALGORITHMS;

EID: 33646830645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11596448_97     Document Type: Conference Paper

References (8)

1. M.Dorigo and G. Di Caro: The Ant Colony Optimization Metaheuristic. In D. Corne, M. Dorigo and F. Glover (eds.): New Ideas in Optimization. McGraw-Hill (1999)
2. Knowles, J. and Corne, D.: A new evolutionary approach to the degree-constrained minimum spanning tree problem. IEEE Trans. on Evolutionary Computation, Vol. 4, Issue 2, (2000) 125-134
3. th I-SPAN on Parallel Architectures, Algorithms, and Networks, (1999) 184-189
4. Mohan Krishnamoorthy, Andreas T. Ernst, Yazid M. Sharaiha: Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree. Journal of Heuristics, Vol. 7, No. 6, (2001), 587-611.
5. th Annual Allerton Conference, (1968), 879-888
6. Raidl, G. R.: An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. IEEE Trans. on Evolutionary Computation, Vol 1, (2000) 104-111
7. Savelsbergh, M. and T. Volgenant: Edge exchanges in the degree-constrained spanning tree problem. Computer and Operation Research, Vol. 12, No. 4, (1985) 341-348
8. Zhou, G., Gen, M. and Tianzu Wu: A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm. International Conf., System, Man, and Cybernetics, Vol. 4 (1996) 2683-2688