The Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints

被引：0
|
作者：
Sun, Minying [1 ]
Wang, Hua [1 ]
机构：
[1] Shandong Univ, Dept Comp Sci & Technol, Jinan, Shandong, Peoples R China
来源：
2013 15TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY (ICACT) | 2013年
关键词：
Application layer multicast; Degree and delay constraints; Memetic algorithm; APPLICATION-LAYER MULTICAST; NETWORKS;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
As the critical technology of many real-time applications, application layer multicast requirements limit the transmission time and the number of receivers to which each node can transmit. Such a communication scheme in an overlay network can be regarded as a degree- and delay-constrained minimum spanning tree (DDCMST) problem, and appears to be NP-complete. This paper proposes a novel Memetic algorithm(MA) to solve the DDCMST problem and compares it with some related methods. The results of a series of simulations show the efficiency and effectiveness of the proposed algorithm.
引用
收藏
页码：78 / 82
页数：5
相关论文
共 50 条
  • [1] A memetic algorithm for the biobjective minimum spanning tree problem
    Rocha, Daniel A. M.
    Gouvea Goldbarg, Elizabeth F.
    Goldbarg, Marco Cesar
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2006, 3906 : 222 - 233
  • [2] A Memetic Algorithm for Solving the Generalized Minimum Spanning Tree Problem
    Pop, Petrica
    Matei, Oliviu
    Sabo, Cosmin
    [J]. SOFT COMPUTING IN INDUSTRIAL APPLICATIONS, 2011, 96 : 187 - 194
  • [3] A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem
    Ruthmair, Mario
    Raidl, Guenther R.
    [J]. COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2011, PT I, 2012, 6927 : 351 - 358
  • [4] A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem
    Zhang, Shufan
    Mao, Jianlin
    Wang, Niya
    Li, Dayan
    Ju, Chengan
    [J]. ENTROPY, 2023, 25 (01)
  • [5] Bees Algorithm For Degree-Constrained Minimum Spanning Tree Problem
    Malik, Meenakshi
    [J]. 2012 NATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION SYSTEMS (NCCCS), 2012, : 97 - 104
  • [6] A memetic algorithm for the optimum communication spanning tree problem
    Fischer, Thomas
    Merz, Peter
    [J]. HYBRID METAHEURISTICS, PROCEEDINGS, 2007, 4771 : 170 - 184
  • [7] An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem
    Raidl, GR
    [J]. PROCEEDINGS OF THE 2000 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2000, : 104 - 111
  • [8] A new genetic algorithm for the degree-constrained minimum spanning tree problem
    Han, LX
    Wang, YP
    Guo, FY
    [J]. Proceedings of 2005 IEEE International Workshop on VLSI Design and Video Technology, 2005, : 125 - 128
  • [9] A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem
    Kavita Singh
    Shyam Sundar
    [J]. Soft Computing, 2020, 24 : 2169 - 2186
  • [10] Optimization algorithm for solving degree-constrained minimum spanning tree problem
    Wang, Zhu-Rong
    Zhang, Jiu-Long
    Cui, Du-Wu
    [J]. Ruan Jian Xue Bao/Journal of Software, 2010, 21 (12): : 3068 - 3081
12345