In this paper, a new algorithm for the solution of the Multicast Routing Problem based on Particle Swarm Optimization algorithm is presented and analyzed. A review of the most important evolutionary optimization algorithms for the solution of this problem is also given. Three different versions of the proposed algorithm are given and their quality is evaluated with experiments conducted on suitably modified benchmark instances of the Euclidean Traveling Salesman Problem from the TSP library. The results indicated the efficiency of the proposed method.
CITATION STYLE
Marinakis, Y., & Migdalas, A. (2014). A particle swarm optimization algorithm for the multicast routing problem. In Springer Proceedings in Mathematics and Statistics (Vol. 104, pp. 69–91). Springer New York LLC. https://doi.org/10.1007/978-3-319-09758-9_7
Mendeley helps you to discover research relevant for your work.