Abstract
In this paper, a new algorithm is proposed for the solution of the Multicast Routing Problem. The algorithm is based on the Artificial Bee Colony approach hybridized with Variable Neighborhood Search. The quality of the algorithm is evaluated with experiments conducted on suitably modified benchmark instances of the Euclidean Traveling Salesman Problem from the TSP library. The results of the algorithm are compared to results obtained by several versions of the Particle Swarm Optimization algorithm. The comparisons indicated the effectiveness of the new approach.
Author supplied keywords
Cite
CITATION STYLE
Marinakis, Y., Marinaki, M., & Migdalas, A. (2016). A hybrid discrete artificial bee colony algorithm for the multicast routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9597, pp. 203–218). Springer Verlag. https://doi.org/10.1007/978-3-319-31204-0_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
