维普中文期刊产品整合服务

On Multicast Routing With Network Coding: A Multiobjective Artificial Bee Colony Algorithm

查看全文 作　　者：Huanlai [1]Xing;Fuhong [1]Song;Lianshan [1]Yan;Wei [1]Pan 高影响力作者 机构地区：[1]The School of Information Science and Technology,Southwest Jiaotong University高影响力机构 出　　处：《China Communications》索引2019年第16卷第2期,共17页高影响力期刊 基　　金：supported in part by National Natural Science Foundation of China (No.61505168, No. 61802319); the Fundamental Research Funds for the Central Universities, P. R. China 摘　　要：This paper is concerned with two important issues in multicast routing problem with network coding for the first time, namely the load balancing and the transmission delay. A bi-objective optimization problem is formulated, where the average bandwidth utilization ratio and the average transmission delay are both to be minimized. To address the problem, we propose a novel multiobjective artificial bee colony algorithm, with two performance enhancing schemes integrated. The first scheme is an elitism-based food source generation scheme for scout bees, where for each scout bee, a new food source is generated by either recombining two elite solutions randomly selected from an archive or sampling the probabilistic distribution model built from all elite solutions in this archive. This scheme provides scouts with high-quality and diversified food sources and thus helps to strengthen the global exploration. The second one is a Pareto local search operator with the concept of path relinking integrated. This scheme is incorporated into the onlooker bee phase for exploring neighboring areas of promising food sources and hence enhances the local exploitation. Experimental results show that the proposed algorithm performs better than a number of state-of-the-art multiobjective evolutionary algorithms in terms of the approximated Pareto-optimal front. 关 键 词：EVOLUTIONARY computation MULTICAST network coding SWARM INTELLIGENCE
相关文献

参考文献(47)

引证文献(2)

耦合文献(4)

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1　渝公网安备 50019002500403号　违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费