A new genetic algorithm based on modified Physarum network model for bandwidth-delay constrained least-cost multicast routing

被引:0
作者
Mingxin Liang
Chao Gao
Zili Zhang
机构
[1] Southwest University,School of Computer and Information Science
[2] Jilin University,Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education
[3] Deakin University,School of Information Technology
来源
Natural Computing | 2017年 / 16卷
关键词
Multicast routing; Genetic algorithm; network model;
D O I
暂无
中图分类号
学科分类号
摘要
A mobile ad hoc network is a kind of popular self-configuring network, in which multicast routing under the quality of service constraints, is a significant challenge. Many researchers have proved that such problem can be formulated as a NP-complete problem and proposed some swarm-based intelligent algorithms to solve the optimal solution, such as the genetic algorithm (GA), bees algorithm. However, a lower efficiency of local search ability and weak robustness still limit the computational effectiveness. Aiming to those shortcomings, a new hybrid algorithm inspired by the self-organization of Physarum, is proposed in this paper. In our algorithm, an updating scheme based on Physarum network model (PM) is used for improving the crossover operator of traditional GAs, in which the same parts of parent chromosomes are reserved and the new offspring by the PM is generated. In order to estimate the effectiveness of our proposed optimized scheme, some typical genetic algorithms and their updating algorithms (PMGAs) are compared for solving the multicast routing on four different datasets. The simulation experiments show that PMGAs are more efficient than original GAs. More importantly, the PMGAs are more robustness that is very important for solving the multicast routing problem. Moreover, a series of parameter analyses is used to find a set of better setting for realizing the maximal efficiency of our algorithm.
引用
收藏
页码:85 / 98
页数:13
相关论文
共 91 条
[1]  
Adamatzky A(2009)Developing proximity graphs by Parallel Process Lett 19 105-127
[2]  
Huang TL(2007) polycephalum: does the plasmodium follow the Toussaint hierarchy? J Parallel Distrib Comput 67 516-530
[3]  
Lee DT(2000)A distributed multicast routing algorithm for real-time applications in wide area networks J Inf Sci Eng 16 885-901
[4]  
Hwang RH(2015)Multicast routing based on genetic algorithms Soft Comput 19 489-498
[5]  
Do WY(2015)Genetic algorithm with ensemble of immigrant strategies for multicast routing in ad hoc networks IEEE Trans Comput 64 819-832
[6]  
Yang SC(2013)Physarum optimization: a biology-inspired algorithm for minimal exposure path problem in wireless sensor networks Commun Lett 17 31-34
[7]  
Karthikeyan P(2014)Genetic algorithm for energy-efficient QoS multicast routing Int J Comput Sci Issues. 11 83-88
[8]  
Baskar S(2000)An efficient genetic algorithm based clonal selection and hill climbing for solving QoS multicast routing problem Nature 407 470-470
[9]  
Liu L(2005)Intelligence: Maze-solving by an amoeboid organism Comput Oper Res 32 1953-1981
[10]  
Song Y(2006)A survey of combinatorial optimization problems in multicast routing ACM SIGCOMM Comput Commun Rev 36 15-16