首页> 外文期刊>Mathematical Problems in Engineering >Novel Degree Constrained Minimum Spanning Tree Algorithm Based on an Improved Multicolony Ant Algorithm
【24h】

Novel Degree Constrained Minimum Spanning Tree Algorithm Based on an Improved Multicolony Ant Algorithm

机译:基于改进的多蚁群算法的度约束最小生成树算法

获取原文
获取原文并翻译 | 示例
           

摘要

Degree constrained minimum spanning tree (DCMST) refers to constructing a spanning tree of minimum weight in a complete graph with weights on edges while the degree of each node in the spanning tree is no more than d (d > 2). The paper proposes an improved multicolony ant algorithm for degree constrained minimum spanning tree searching which enables independent search for optimal solutions among various colonies and achieving information exchanges between different colonies by information entropy. Local optimal algorithm is introduced to improve constructed spanning tree. Meanwhile, algorithm strategies in dynamic ant, random perturbations ant colony, and max-min ant system are adapted in this paper to optimize the proposed algorithm. Finally, multiple groups of experimental data show the superiority of the improved algorithm in solving the problems of degree constrained minimum spanning tree.
机译:度约束最小生成树(DCMST)是指在一个完整的图中构造最小权重的生成树,边上具有权重,而生成树中每个节点的度不超过d(d> 2)。提出了一种用于度约束最小生成树搜索的改进的多蚁群算法,该算法能够独立搜索各个菌落之间的最优解,并通过信息熵实现不同菌落之间的信息交换。引入局部最优算法来改进构造的生成树。同时,本文针对动态蚂蚁,随机扰动蚁群和最大最小蚂蚁系统的算法策略进行了优化。最后,多组实验数据表明改进算法在解决度约束最小生成树问题上的优越性。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2015年第16期|601782.1-601782.13|共13页
  • 作者单位

    Tianjin Polytechn Univ, Sch Comp Sci & Software, Tianjin 300387, Peoples R China.;

    Tianjin Polytechn Univ, Sch Comp Sci & Software, Tianjin 300387, Peoples R China.;

    Tianjin Polytechn Univ, Sch Comp Sci & Software, Tianjin 300387, Peoples R China.;

    Tianjin Polytechn Univ, Sch Comp Sci & Software, Tianjin 300387, Peoples R China.;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号