A Novel Genetic Algorithm for Degree-Constrained Minimum Spanning Tree Problem

被引：0
|
作者：
Hanr, Lixia [1 ]
Wang, Yuping [2 ]
机构：
[1] Xidian Univ, Sch Sci, Xian 710071, Peoples R China
[2] Xidian Univ, Sch Comp Sci & Technol, Xian 710071, Peoples R China
来源：
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY | 2006年 / 6卷 / 7A期
基金：
中国国家自然科学基金;
关键词：
degree-constrained minimum spanning tree; genetic algorithm; convergence;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A novel genetic algorithm is proposed for degreeconstrained Minimum Spanning Tree (short for d-MST) problem in this paper. First, a novel model that transfer dMST problem into a preference two objective MST problem is presented. Based on this model, a new crossover operator, a local search scheme, a mutation operator and a new selection operator are designed based on the preference of the two objectives. Then, a new genetic algorithm (short for GA) is proposed. Furthermore, the convergence of the proposed algorithm to globally optimal solution with probability one is proved. The simulation results indicate the proposed algorithm is effective.
引用
收藏
页码：50 / 57
页数：8
相关论文
共 50 条
  • [1] A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem
    Kavita Singh
    Shyam Sundar
    Soft Computing, 2020, 24 : 2169 - 2186
  • [2] A new genetic algorithm for the degree-constrained minimum spanning tree problem
    Han, LX
    Wang, YP
    Guo, FY
    Proceedings of 2005 IEEE International Workshop on VLSI Design and Video Technology, 2005, : 125 - 128
  • [3] Degree-Constrained Minimum Spanning Tree Problem Using Genetic Algorithm
    Liu, Keke
    Chen, Zhenxiang
    Abraham, Ajith
    Cao, Wenjie
    Jing, Shan
    PROCEEDINGS OF THE 2012 FOURTH WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC), 2012, : 8 - 14
  • [4] A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem
    Singh, Kavita
    Sundar, Shyam
    SOFT COMPUTING, 2020, 24 (03) : 2169 - 2186
  • [5] Bees Algorithm For Degree-Constrained Minimum Spanning Tree Problem
    Malik, Meenakshi
    2012 NATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION SYSTEMS (NCCCS), 2012, : 97 - 104
  • [6] Partheno-genetic algorithm for solving the degree-constrained minimum spanning tree problem
    Song, Hai-Zhou
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2005, 25 (04): : 61 - 66
  • [7] A new approach to the degree-constrained minimum spanning tree problem using Genetic Algorithm
    Zhou, GG
    Gen, M
    Wu, TZ
    INFORMATION INTELLIGENCE AND SYSTEMS, VOLS 1-4, 1996, : 2683 - 2688
  • [8] An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem
    Raidl, GR
    PROCEEDINGS OF THE 2000 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2000, : 104 - 111
  • [9] Optimization algorithm for solving degree-constrained minimum spanning tree problem
    Wang Z.-R.
    Zhang J.-L.
    Cui D.-W.
    Ruan Jian Xue Bao/Journal of Software, 2010, 21 (12): : 3068 - 3081
  • [10] Fuzzy Degree-Constrained Minimum Spanning Tree problem
    Lu, Yiwen
    Proceedings of the Fifth International Conference on Information and Management Sciences, 2006, 5 : 578 - 584
12345