Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

A particle swarm optimization algorithm for the multicast routing problem

Marinakis Ioannis, Athanasios Migdalas

Full record

URI: http://purl.tuc.gr/dl/dias/E8E1CDCA-4962-48E0-8807-28C1AD2E4CE9
Year 2014
Type of Item Conference Paper Abstract
License
Details
Bibliographic Citation Y. Marinakis and A. Migdalas, “A Particle Swarm Optimization algorithm for the Multicast Routing Problem”, in 2015 Models, Algorithms and Technologies for Networks Analysis, Springer Proceedings in Mathematics & Statistics 104, pp. 69-91. DOI 10.1007/978-3-319-09758-9_7 https://doi.org/10.1007/978-3-319-09758-9_7
Appears in Collections
Conference Publications in Community School of Production Engineering and Management

Summary

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.

Services

Statistics

 

Copyright © DIAS 2013