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

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 485-491

  Doan, Minh N ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ANT-BASED ALGORITHMS; SPANNING TREE PROBLEM;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING;

CONSTRAINT THEORY;

EID: 80053170566     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4424510     Document Type: Conference Paper

References (34)

1. S. Goss, S. Aron, J.L. Deneubourg, and J.M. Pastells, "Self-organized shortcuts in the argentine ant", Naturwissenschaften, vol. 76, pp. 579-581, 1989.
2. R. Beckers, J.L. Deneubourg, and S. Goss, "Trails and U-turns in the selection of the shortest path by the ant Lasius Niger", Journal of Theoretical Biology, vol. 159, pp.397-415, 1992.
3. B. Hölldobler and E.o. Wilson, the ants. Springer-Verlag, Berlin, 1990.
4. Marco Dorigo, Luca Maria Gambardella, "Ant Colony System: A Cooperative Learning Approach to the Traveling salesman Problem", TR/IRIDIA/1996-5.
5. B. Boldon, N. Deo, and N. Kumar, "Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine", Parallel Computing (22): 369-382, 1996.
6. Thang N. Bui and Catherine M. Zrncic, "An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree", GECCO06, July 812, 2006, Seattle, Washington, USA.
7. B. M. E. Moret and H. D. Shapiro. "An empirical assessment of algorithms for constructing a minimum spanning tree". In N. Dean and G. E. Shannon, editors, Computational Support for Discrete Mathematics, DIMACS Workshop, March 12-14, 1992. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, V. 15, pp. 99-117, 1994.
8. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis II. "An analysis of several heuristics for the traveling salesman problem", SIAM Journal on Computing, 6(3):563-581, 1977.
9. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III. "Many birds with one stone: Multi-objective approximation algorithms", Proc. of the 25th Annual ACM Symposium on Theory of Computing (STOCS '93), pp. 438-447, 1993.
10. P. J. M. van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications, Dordrecht, Netherlands: Reidel, 1987.
11. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Reading, MA: Addison-Wesley, 1989.
12. Ravi, R., M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, "Many Birds with One Stone: Multi-Objective Approximation Algorithms", Proc. of the 25th ACM Symposium on Computing (STOC), 1993, pp. 438447.
13. S. C. Narula and C. A. Ho,"Degree-constrained minimum spanning tree", Comput. Oper. Res., vol. 7, no. 4, pp. 239249, 1980.
14. D. S. Johnson,"The NP-completeness column: An ongoing guide", J. Algorithms, vol. 6, no. 1, pp. 145159, 1985.
15. N. Deo and S. L. Hakimi. "The shortest generalized Hamiltonian tree", Proc. 6th Annual Allerton Conference, pp. 879-888, 1968.
16. C. H. Papadimitriou and U. V. Vazirani. "On two geometric problems related to traveling salesman problem", J. Algorithms, 5:231-246, 1984.
17. S. Khuller, B. Raghavachari, and N. Young. "Low degree spanning tree of small weights", Proc. of 26th Annual ACM STOCS, pp. 412-421, 1994.
18. B. Gavish. "Topological design of centralized computer networks - Formulation and algorithms", Networks, 12(4):355-377, 1982.
19. M. Savelsbergh and T. Volegnant. "Edge exchanges in the degreeconstrained minimum spanning tree problem", Computers and Operations Research, 12(4):341-348, 1985.
20. T.Volegnant and R. Jonker. "The symmetric traveling salesman problem and edge exchanges in minimum 1-trees", European Journal of Operational Research, 12(4):394-403,1983.
21. T. Volegnant. "A Lagrangian approach to the degreeconstrained minimum spanning tree problem", European Journal of Operational Research, 39(3):325-331, 1989.
22. M. Krishnamoorthy, G. Craig, and M. Palaniswami."Comparison of heuristic algorithms for the degree constrained minimum spanning tree", In I. H. Osman and J. P. Kelly, editors, Metaheuristics: Theory and Applications, pp. 83-96, 1996.
23. B. Boldon, N. Deo, and N. Kumar, "Minimum-weight degreeconstrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine", Dept. Comput. Sci., Univ. Central Florida, Orlando, FL, Tech. Rep. CS-TR-95-02, 1995.
24. G. Zhou and M. Gen,"A note on genetic algorithms for degree-constrained spanning tree problems", Networks, vol. 30, pp. 9195, 1997.
25. A. K. Obruca, "Spanning tree manipulation and the travelling-salesman problem", Comput. J., vol. 10, no. 4, pp. 374-377, 1968.
26. Krishnamoorthy, M., A. T. Ernst, and Y. M. Sharaiha, "Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree", Journal of Heuristics, 7, 2001, pp. 587611.
27. Raidl, G. R. and B. A. Julstrom, "Edge-Sets: An Effective Evolutionary Coding of Spanning Trees", IEEE Trans. On Evolutionary Computation, 7(3), 2003, pp. 225239.
28. Delbem, C. B., A. de Carvalho, C. A. Policastro, A. K. O. Pinto, K. Honda, and A. C. Garcia, "ode-Depth Encoding for Evolutionary Algorithms Applied to Network Design," GECCO 2004, Lecture Notes in Computer Science, 3102, 2004, pp. 678687.
29. Soak, S., D. Corne, and B. Ahn,"A Powerful New Encoding for Tree-Based Combinatorial Optimization Problems," Lecture Notes in Computer Science, 3242, 2004, pp. 430439.
30. Knowles, J. and D. Corne, "A New Evolutionary Approach to the Degree-Constrained Minimum Spanning Tree Problem," IEEE Trans. On Evolutionary Computation, 4(2), 2000, pp. 125134.
31. Raidl, G. R., An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem, Proc. IEEE CEC, 2000, pp. 104111.
32. Raidl, G. R. and B. A. Julstrom, "A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem," Proc. 2000 ACM Symposium on Applied Computing, 2000, pp. 440445.
33. Knowles, J. and D. Corne, "A New Evolutionary Approach to the Degree-Constrained Minimum Spanning Tree Problem," IEEE Trans. On Evolutionary Computation, 4(2), 2000, pp. 125134.
34. P. J. Werbos, "Building and understanding adaptive systems: A statistical/numerical approach to factory automation and brain research," IEEE Transactions on Systems, Man, and Cybernetics, vol. SMC-17, pp. 7-20, Jan./Feb. 1987.