A hybrid discrete artificial bee colony algorithm for the multicast routing problem
- Μαρινακης Ιωαννης(http://users.isc.tuc.gr/~imarinakis)
- Marinakis Ioannis(http://users.isc.tuc.gr/~imarinakis)
- Μαρινακη Μαγδαληνη(http://users.isc.tuc.gr/~mmarinaki)
- Marinaki Magdalini(http://users.isc.tuc.gr/~mmarinaki)
- Μυγδαλας Αθανασιος(http://users.isc.tuc.gr/~amygdalas)
- Mygdalas Athanasios(http://users.isc.tuc.gr/~amygdalas)
DOI Publisher
Springer Science and Business Media LLC ISSN
0302-9743 Citation count (estimate)
6Abstract
Summarization: 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.Παρουσιάστηκε στο: 19th European Conference on Applications of Evolutionary Computatio
Add to ORKG