A hybrid discrete artificial bee colony algorithm for the multicast routing problemA hybrid discrete artificial bee colony algorithm for the multicast routing problem Πλήρης Δημοσίευση σε Συνέδριο Conference Full Paper 2018-11-192016enIn 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.http://creativecommons.org/licenses/by/4.0/203-21819th European Conference on Applications of Evolutionary ComputationApplications of Evolutionary Computation Marinakis Ioannis Μαρινακης Ιωαννης Marinaki Magdalini Μαρινακη Μαγδαληνη Mygdalas Athanasios Μυγδαλας Αθανασιος Springer Verlag Artificial bee colony Multicast routing problem Variable neighborhood search