A particle swarm optimization-like algorithm for constrained minimal spanning tree problems

Journal of Marine Science and Technology (Taiwan)

Volumn 22, Issue 3, 2014, Pages 341-351

  Yeh, Chun Chao ^a   Chien, Ying Che ^a  

^a NATIONAL TAIWAN OCEAN UNIVERSITY   (Taiwan)

Author keywords

Ant colony optimization; Constrained minimal spanning tree; Evolutionary algorithm; Genetic algorithm

Indexed keywords

ANT COLONY OPTIMIZATION; CONSTRAINED OPTIMIZATION; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; PARALLEL ARCHITECTURES; PARTICLE SWARM OPTIMIZATION (PSO); PROBLEM SOLVING; TREES (MATHEMATICS);

A-PARTICLES; ALGORITHM FOR SOLVING; COMPUTATION TIME; DELAY CONSTRAINTS; DENSE GRAPHS; MINIMAL SPANNING TREE; PSO(PARTICLE SWARM OPTIMIZATION); SOLUTION QUALITY;

ALGORITHMS;

EID: 84907385443     PISSN: 10232796     EISSN: None     Source Type: Journal    
DOI: 10.6119/JMST-013-1119-2     Document Type: Article

References (43)

1. Aissa, M. and Ben Mnaouer, A., "A new delay-constrained algorithm for multicast routing tree construction," International Journal of Communication Systems, Vol. 17, No. 10, pp. 985-1000 (2004).
2. Almeida, A. M., Martins, P., and De Souza, M. C., "md-MST is NP-hard for d ≥ 3," Electronic Notes in Discrete Mathematics, Vol. 36, pp. 9-15 (2010).
3. Bau, Y. T., Ho, C. K., and Ewe, H. T., "An ant colony optimization approach to the degree-constrained minimum spanning tree problem," Proceeding of 2005 International Conference on Computational Intelligence and Security (CIS 2005), Part I, LNAI 3801, pp. 657-662 (2005).
4. Behle, M., Juenger, M., and Liers, F., "A primal branch-and-cut algorithm for the degree-constrained minimum spanning tree problem," Proceeding of 6th Workshop on Experimental Algorithms (WEA 2007), LNCS 4525, pp. 379-392 (2007).
5. Benyahia, I., "A survey of ant colony optimization algorithms for telecommunication networks," International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 3, No. 2, pp. 18-32 (2012).
6. Binh, H. T. T. and Nguyen, T. B., "New particle swarm optimization algorithm for solving degree constrained minimum spanning tree problem," Proceeding of 10th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2008), LNAI 5351, pp. 1077-1085 (2008).
7. Bui, T. N. and Zrncic, C. M., "An ant-based algorithm for finding degree-constrained minimum spanning tree," Proceeding of the 8th Annual Conference on Genetic and Evolutionary Computation (GECCO'06), Seattle, WA, USA, pp. 11-18 (2006).
8. Chen, L., Yang, Z., and Xu, Z., "A degree-delay-constrained genetic algorithm for multicast routing tree," Proceeding of the Fourth International Conference on Computer and Information Technology, Wuhan, China, pp. 1033-1038 (2004).
9. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C., Introduction to Algorithms, 3rd Ed., The MIT Press, Cambridge, MA (2009).
10. Craveirinha, J., Climaco, J., Martins, L., Da Silva, C. G., and Ferreira, N., "A bi-criteria minimum spanning tree routing model for MPLS/overlay networks," Telecommunication Systems, Vol. 52, No. 1, pp. 203-215 (2013).
11. Deo, N. and Micikevicius, P., "A heuristic for a leaf constrained minimum spanning tree problem," Congressus Numerantium, Vol. 141, pp. 61-72 (1999).
12. Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP Completeness, W.H. Freeman, New York (1979).
13. Ghaboosi, N. and Haghighat, A. T., "Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing," Telecommunication Systems, Vol. 34, Nos. 3-4, pp. 147-166 (2007).
14. Gouveia, L., Moura, P., and DeSousa, A., "Spanning trees with generalized degree constraints arising in the design of wireless networks," Proceeding of 2011 International Network Optimization Conference (INOC 2011), LNCS 6701, pp. 77-82 (2011).
15. Gruber, M., van Hemert, J., and Raidl, G. R., "Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a vns, ea, and aco," Proceeding of the 8th Annual Conference on Genetic and Evolutionary Computation (GECCO'06), Seattle, WA, USA, pp. 1187-1194 (2006).
16. Jovanovic, R. and Tuba, M., "Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem," Computer Science and Information Systems (ComSIS), Vol. 10, No. 1, pp. 133-149 (2013).
17. Julstrom, B. A., "Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem," International Journal of Applied Mathematics and Computer Science, Vol. 14, No. 3, pp. 385-396 (2004).
18. Krishnamoorthy, M. and Ernst, A. T., "Comparison of algorithms for the degree constrained minimum spanning tree," Journal of Heuristics, Vol. 7, No. 6, pp. 587-611 (2001).
19. Kruskal, J., "On the shortest spanning subtree of a graph and the traveling salesman problem," Proceedings of the American Mathematical Society, Vol. 7, No. 1, pp. 48-50 (1956).
20. Kuo, H.-C., Chang, J.-R., and Liu, C.-H., "Particle swarm optimization for global optimization problems," Journal of Marine Science and Technology, Vol. 14, No. 3, pp. 170-181 (2006).
21. Leggieri, V., Haouari, M., and Triki, C., "A branch-and-cut algorithm for the Steiner tree problem with delays," Optimization Letters, Vol. 6, No. 8, pp. 1753-1771 (2011).
22. Liang, Y.-H., Chang, B.-J., and Lin, Y.-M., "Solve the tree setup problem and minimize control overhead for high-density members in delay-bounded distributed multicast networks," Wireless Personal Communications, Vol. 65, No. 4, pp. 875-894 (2012).
23. Martinez, L. C. and Da Cunha, A. S., "A parallel Lagrangian relaxation algorithm for the min-degree constrained minimum spanning tree problem," Proceeding of 2nd International Symposium on Combinatorial Optimization (ISCO 2012), LNCS 7422, pp. 237-248 (2012).
24. Mauthe, A., Hutchison, D., Coulson, G., and Namuye, S., "Multimedia group communications: towards new services," Distributed Systems Engineering, Vol. 8, No. 3, pp. 197-210 (1996).
25. Moy, J., "Multicast routing extensions for OSPF," Communications of the ACM, Vol. 37, No. 8, pp. 61-67 (1994).
26. Narula, S. C. and Ho, C. A., "Degree-constrained minimum spanning trees," Computers and Operations Research, Vol. 7, No. 4, pp. 239-249 (1980).
27. Oencan, T., Cordeau, J.-F., and Laporte, G., "A tabu search heuristic for the generalized minimum spanning tree problem," European Journal of Operational Research, Vol. 191, No. 2, pp. 306-319 (2008).
28. Pham, Q. D., Deville, Y., and Van Hentenryck, P., "LS(Graph): a constraint-based local search for constraint optimization on trees and paths," Constraints, Vol. 17, No. 4, pp. 357-408 (2012).
29. Prim, R. C., "Shortest connection networks and some generalizations," Bell System Technical Journal, Vol. 36, pp. 1389-1401 (1957).
30. Qu, R., Xu, Y., Castro, J. P., and Landa-Silva, D., "Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems," Journal of Heuristics, Doi: 10.1007/s10732-012-9198-2 (2012).
31. Ravi, R., Marathe, M. V., Ravi, S. S., Rosenkrantz, D.-J., and Hunt III, H. B., "Approximation algorithms for degree-constrained minimum-cost network-design problems," Algorithmica, Vol. 31, No. 1, pp. 58-78 (2001).
32. Reimann, M. and Laumanns, M., "A hybrid aco algorithm for the capacitated minimum spanning tree problem," Proceeding of First International Workshop on Hybrid Metahuristics (HM2004), Valencia, Spain, pp. 1-10 (2004).
33. Salama, H. F., Reeves, D. S., and Viniotis, Y., "The delay constrained minimum spanning tree problem," Proceeding of the Second IEEE Symposium on Computers and Communications, Alexandria, Egypt, pp. 699-703 (1997).
34. Singh, A., "An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem," Applied Soft Computing, Vol. 9, No. 2, pp. 625-631 (2009).
35. Skorin-Kapov, N. and Kos, M., "A grasp heuristic for the delay-constrained multicast routing problem," Telecommunication Systems, Vol. 32, No. 1, pp. 55-69 (2006).
36. Soak, S.-M., Corne, D., and Ahn, B.-H., "A new encoding for the degree constrained minimum spanning tree problem," Proceeding of 8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2004), LNAI 3213, pp. 952-958 (2004).
37. Soak, S.-M. and Jeon, M., "The property analysis of evolutionary algorithms applied to spanning tree problems," Applied Intelligence, Vol. 32, No. 1, pp. 96-121 (2010).
38. Torkestani, J. A., "An adaptive heuristic to the bounded-diameter minimum spanning tree problem," Soft Computing, Vol. 16, No. 11, pp. 1977-1988 (2012).
39. Tseng, S.-Y., Huang, Y.-M., and Lin, C.-C., "Genetic algorithm for delay and degree-constrained multimedia broadcasting on overlay networks," Computer Communications, Vol. 29, No. 17, pp. 3625-3632 (2006).
40. Tseng, S.-Y., Lin, C.-C., and Huang, Y.-M., "Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints," Expert Systems with Applications, Vol. 35, No. 3, pp. 1473-1481 (2008).
41. Waitzman, D., Partridge, C., and Deering, S. E., "Distance vector multicast routing protocol," IETF RFC 1075 (1988).
42. Xu, Y. and Qu, R., "A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems," Applied Intelligence, Vol. 36, pp. 229-241 (2012).
43. Xue, G. L., "Minimum-cost QoS multicast and unicast routing in communication networks," IEEE Transactions on Communications, Vol. 51, No. 5, pp. 817-824 (2003).