Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/364C4F17-9880-49CC-9B2E-6F5CFA422A7F | ||
| Year | 2016 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | Y. Marinakis, M. Marinaki and A. Migdalas, "A hybrid discrete artificial bee colony algorithm for the multicast routing problem," in 19th European Conference on Applications of Evolutionary Computation, 2016, pp. 203-218. doi: 10.1007/978-3-319-31204-0_14 https://doi.org/10.1007/978-3-319-31204-0_14 | ||
| Appears in Collections |
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.
Copyright © DIAS 2013
