Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Multiobjective Particle Swarm Optimization for a Multicast Routing Problem
School of Production Engineering and Management, Technical University of Crete, Decision Support Systems Laboratory, Department of Production Engineering and Management, Technical University of Crete.
Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Business Administration and Industrial Engineering.ORCID iD: 0000-0001-8473-3663
2014 (English)In: Examining Robustness and Vulnerability of Networked Systems: Proceedings of the NATO Advanced Research Workshop on Examining Robustness and Vulnerability of Critical Infrastructure Networks, Kiev, Ukraine, 3-5 June 2013 / [ed] Sergiy Butenko; Eduardo Pasiliao; Volodymyr Shylo, IOS Press, 2014, Vol. 37, p. 161-175Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
IOS Press, 2014. Vol. 37, p. 161-175
Series
NATO Science for Peace and Security Series - D: Information and Communication Security ; 37
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Industrial Logistics
Identifiers
URN: urn:nbn:se:ltu:diva-27729DOI: 10.3233/978-1-61499-391-9-161Local ID: 1437d67f-bd30-48bf-b0fa-776fc97acc95ISBN: 978-1-61499-390-2 (print)ISBN: 978-1-61499-391-9 (electronic)OAI: oai:DiVA.org:ltu-27729DiVA, id: diva2:1000918
Note
Godkänd; 2014; 20140918 (athmig)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-04-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Migdalas, Athanasios

Search in DiVA

By author/editor
Migdalas, Athanasios
By organisation
Business Administration and Industrial Engineering
Production Engineering, Human Work Science and Ergonomics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 28 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf