An improved ant-based algorithm for the degree-constrained minimum spanning tree problem

IEEE Transactions on Evolutionary Computation

Volumn 16, Issue 2, 2012, Pages 266-278

  Bui, Thang N ^a   Deng, Xianghua ^a,b   Zrncic, Catherine M ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b GOOGLE INC   (United States)

Author keywords

Ant based algorithm; degree constrained spanning tree

Indexed keywords

COMPLETE GRAPHS; DEGREE-CONSTRAINED MINIMUM SPANNING TREE; DEGREE-CONSTRAINED SPANNING TREES; LOCAL OPTIMIZATION ALGORITHM; LOW COSTS; MINIMUM COST SPANNING TREE; NP-HARD; PROBLEM INSTANCES; SPANNING TREE;

PARALLEL ARCHITECTURES;

ALGORITHMS;

EID: 84859709381     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2011.2125971     Document Type: Article

References (30)

1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press, 2001.
2. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
3. S. Narula and C. Ho, "Degree-constrained minimum spanning tree," Comput. Oper. Res., vol. 7, no. 4, pp. 239-249, 1980.
4. M. Savelsbergh and T. Volgenant, "Edge exchanges in the degreeconstrained minimum spanning tree problem," Comput. Oper. Res., vol. 12, no. 4, pp. 341-348, 1985. (Pubitemid 15509360)
5. J. Knowles and D. Corne, "A new evolutionary approach to the degreeconstrained minimum spanning tree problem," IEEE Trans. Evol. Comput., vol. 4, no. 2, pp. 125-134, Jul. 2000.
6. R. Ravi, M. Marathe, S. Ravi, D. Rosenkrantz, and H. Hunt, III, "Many birds with one stone: Multiobjective approximation algorithms," in Proc. 25th Annu. ACM Symp. Theory Comput., 1993, pp. 438-447. (Pubitemid 23668752)
7. G. Craig, M. Krishnamoorthy, and M. Palaniswami, "Comparison of heuristic algorithms for the degree constrained minimum spanning tree," in Metaheuristics: Theory and Applications. Boston, MA: Kluwer, 1996.
8. M. Krishnamoorthy, A. T. Ernst, and Y. M. Sharaiha, "Comparison of algorithms for the degree constrained minimum spanning tree," J. Heuristics, vol. 7, no. 6, pp. 587-611, 2001. (Pubitemid 33068055)
9. B. Boldon, N. Deo, and N. Kumar, "Minimum-weight degreeconstrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine," Parallel Comput., vol. 22, no. 3, pp. 369-382, 1996. (Pubitemid 126343060)
10. G. Zhou and M. Gen, "A note on genetic algorithms for degreeconstrained spanning tree problems," Networks, vol. 30, no. 2, pp. 91-95, 1998.
11. G. Raidl and B. Julstrom, "A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem," in Proc. ACM Symp. Appl. Comput., vol. 1. 2000, pp. 440-445.
12. G. Raidl and B. Julstrom, "Edge sets: An effective evolutionary coding of spanning trees," IEEE Trans. Evol. Comput., vol. 7, no. 3, pp. 225-239, Jun. 2003.
13. G. Raidl, "An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem," in Proc. IEEE CEC, vol. 1. Jul. 2000, pp. 104-111.
14. S.-M. Soak, D. Corne, and B.-H. Ahn, "A powerful new encoding for tree-based combinatorial optimization problems," in Proc. PPSN, LNCS 3242. 2004, pp. 430-439. (Pubitemid 39750244)
15. T. N. Bui, T. H. Nguyen, and J. R. Rizzo, Jr., "Parallel shared memory strategies for ant-based optimization algorithms," in Proc. Genet. Evol. Comput., 2009, pp. 1-8.
16. M. Dorigo, V. Maniezzo, and A. Colorni, "Ant system: Optimization by a colony of cooperating agents," IEEE Trans. Syst. Man Cybern. Part B, vol. 26, no. 1, pp. 29-41, Feb. 1996. (Pubitemid 126780573)
17. M. Dorigo and G. Di Caro, "Ant colony optimization: A new metaheuristic," in Proc. IEEE CEC, Jul. 1999, pp. 1470-1477.
18. M. Dorigo, G. Di Caro, and L. M. Gambardella, "Ant algorithms for discrete optimization," Artif. Life, vol. 5, no. 2, pp. 137-172, 1999.
19. A. Volgenant, "A Lagrangian approach to the degree-constrained minimum spanning tree problem," Eur. J. Oper. Res., vol. 39, no. 3, pp. 325-331, 1989.
20. Y.-T. Bau, C. K. Ho, and H. T. Ewe, "An ant colony optimization approach to the degree-constrained minimum spanning tree problem," in Proc. CIS, LNCS 3801. 2005, pp. 657-662. (Pubitemid 43775150)
21. T. N. Bui and C. M. Zrncic, "An ant-based algorithm for finding degreeconstrained minimum spanning tree," in Proc. Genet. Evol. Comput., 2006, pp. 11-18. (Pubitemid 44611289)
22. M. Doan, "An effective ant-based algorithm for the degree-constrained minimum spanning tree problem," in Proc. IEEE CEC, Sep. 2007, pp. 485-491.
23. H. Binh and T. Nguyen, "New particle swarm optimization algorithm for solving degree constrained minimum spanning tree problem," in Proc. Pacific Rim Int. Conf. Artif. Intell. Trends Artif. Intell., 2008, pp. 1077-1085.
24. A. T. Ernst, "A hybrid Lagrangian particle swarm optimization algorithm for the degree-constrained minimum spanning tree problem," in Proc. IEEE CEC, Jul. 2010, pp. 1-8.
25. T. N. Bui and B. Moon, "Genetic algorithm and graph partitioning," IEEE Trans. Comput., vol. 45, no. 7, pp. 841-855, Jul. 1996. (Pubitemid 126784444)
26. T. Sẗutzle and H. Hoos, "MAX-MIN ant system," Future Generation Comput. Syst., vol. 16, no. 8, pp. 889-914, 2000.
27. A. Delbem, A. de Carvalho, C. Policastro, A. Pinto, K. Honda, and A. Garcia, "Node-depth encoding for evolutionary algorithms applied to network design," in Proc. Genet. Evol. Comput., LNCS 3102. 2004, pp. 678-687. (Pubitemid 39747262)
28. M. Matsumoto and T. Nishimura, "Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator," ACM Trans. Modeling Comput. Simul., vol. 8, no. 1, pp. 3-30, 1998.
29. S.-M. Soak, D. W. Corne, and B.-H. Ahn, "The edge-window-decoder representation for tree-based problems," IEEE Trans. Evol. Comput., vol. 10, no. 2, pp. 124-144, Apr. 2006.
30. R. V. Hogg and E. Tanis, Probability and Statistical Inference, 8th ed. Englewood Cliffs, NJ: Prentice-Hall, 2009.