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

Search

Browse

My Space

Multiobjective particle swarm optimization for a multicast routing problem

Marinakis Ioannis, Athanasios Migdalas

Full record


URI: http://purl.tuc.gr/dl/dias/1A538DD7-53B8-4D71-8F00-4689DE508FB4
Year 2012
Type of Item Conference Paper Abstract
License
Details
Bibliographic Citation Y. Marinakis and A. Migdalas, “Multiobjective Particle Swarm Optimization for a Multicast Routing Problem”, in NATO Advanced Research Workshop, 2013, pp. 161. doi: 10.3233/978-1-61499-391-9-161 https://doi.org/10.3233/978-1-61499-391-9-161
Appears in Collections

Summary

Routing has always been of immense importance in communication networks due to its impact on the network performance. The significance of scalable and adaptive routing has sky-rocked during the last decade as a consequence of the ever increasing demand for Internet and mobile communications. A routing algorithm selects one or more paths over which devices communicate with each other. In this paper, a new Multiobjective Particle Swarm Optimization (MOPSO) algorithm, with a new velocity equation, for the solution of the Multiobjective Multicast Routing Problem is proposed and tested. A number of variants of the proposed algorithm with global and local exploration abilities are presented and compared with each other. In order to estimate the quality of the methodology, experiments are conducted using classic Euclidean Traveling Salesman Problem benchmark instances taken from the TSP library, modified suitably for the selected problem. The preliminary results indicate the efficiency of the proposed method.

Services

Statistics