You are not logged in.

A new physarum network based genetic algorithm for bandwidth-delay constrained least-cost multicast routing

Liang, Mingxin, Gao, Chao, Liu, Yuxin, Tao, Li and Zhang, Zili 2015, A new physarum network based genetic algorithm for bandwidth-delay constrained least-cost multicast routing. In Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S. and Engelbrecht, A. (ed), Advances in swarm and computational intelligence, Springer, Cham, Switzerland, pp.273-280, doi: 10.1007/978-3-319-20472-7_29.

Attached Files
Name Description MIMEType Size Downloads

Title A new physarum network based genetic algorithm for bandwidth-delay constrained least-cost multicast routing
Author(s) Liang, Mingxin
Gao, Chao
Liu, Yuxin
Tao, Li
Zhang, ZiliORCID iD for Zhang, Zili orcid.org/0000-0002-8721-9333
Title of book Advances in swarm and computational intelligence
Editor(s) Tan, Y.
Shi, Y.
Buarque, F.
Gelbukh, A.
Das, S.
Engelbrecht, A.
Publication date 2015
Series Lecture notes in computer science; v.9141
Chapter number 29
Total chapters 52
Start page 273
End page 280
Total pages 8
Publisher Springer
Place of Publication Cham, Switzerland
Summary Bandwidth-delay constrained least-cost multicast routing is a typical NP-complete problem. Although some swarm-based intelligent algorithms (e.g., genetic algorithm (GA)) are proposed to solve this problem, the shortcomings of local search affect the computational effectiveness. Taking the ability of building a robust network of Physarum network model (PN), a new hybrid algorithm, Physarum network-based genetic algorithm (named as PNGA), is proposed in this paper. In PNGA, an updating strategy based on PN is used for improving the crossover operator of traditional GA, in which the same parts of parent chromosomes are reserved and the new offspring by the Physarum network model is generated. In order to estimate the effectiveness of our proposed optimized strategy, some typical genetic algorithms and the proposed PNGA are compared for solving multicast routing. The experiments show that PNGA has more efficient than original GA. More importantly, the PNGA is more robustness that is very important for solving the multicast routing problem.
Notes 6th International Conference, ICSI 2015 held in conjunction with the Second BRICS Congress, CCI 2015 Beijing, China, June 25–28, 2015 Proceedings, Part II
ISBN 9783319204710
ISSN 0302-9743
1611-3349
Language eng
DOI 10.1007/978-3-319-20472-7_29
Field of Research 08 Information And Computing Sciences
080503 Networking and Communications
Socio Economic Objective 890205 Information Processing Services (incl. Data Entry and Capture)
HERDC Research category B1 Book chapter
ERA Research output type B Book chapter
Copyright notice ©2015, Springer
Persistent URL http://hdl.handle.net/10536/DRO/DU:30082179

Document type: Book Chapter
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 2 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 97 Abstract Views, 5 File Downloads  -  Detailed Statistics
Created: Mon, 14 Mar 2016, 13:43:58 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.