首页 | 官方网站   微博 | 高级检索  
     

基于蚁群算法的多目标网络铺设策略研究
引用本文:龚承柱,诸克军,郭海湘.基于蚁群算法的多目标网络铺设策略研究[J].计算机工程,2011,37(15):177-180.
作者姓名:龚承柱  诸克军  郭海湘
作者单位:1. 中国地质大学经济管理学院,武汉,430074
2. 中国地质大学经济管理学院,武汉,430074;西安交通大学管理学院,西安,710049
基金项目:高等学校博士学科点专项科研基金,中国博士后基金,中央高校基本科研业务费专项基金,中国地质大学(武汉)资源环境经济研究中心开放基金
摘    要:研究通信网络在不同目标下的铺设策略。为满足不同需求,建立网络终端之间的距离矩阵并将其转化为一个全连通无向赋权图。根据网络设计标准,以最低成本为唯一目标建立最短路径模型,利用Prim算法求解得到最小生成树。在最小生成树逻辑结构上建立稳定性度约束模型,给出满足度约束的铺设方案。综合考虑网络铺设的多方面影响因素,建立多目标组合优化模型,基于蚁群算法设计不同链路通断概率、不同链路数目和较高稳定性下的全局最优铺设策略。

关 键 词:网络铺设  最小生成树  Prim算法  蚁群算法  组合优化
收稿时间:2011-03-07

Research of Multi-objective Network Laying Strategy Based on Ant Colony Algorithm
GONG Cheng-zhu,ZHU Ke-jun,GUO Hai-xiang.Research of Multi-objective Network Laying Strategy Based on Ant Colony Algorithm[J].Computer Engineering,2011,37(15):177-180.
Authors:GONG Cheng-zhu  ZHU Ke-jun  GUO Hai-xiang
Affiliation:1,2(1.School of Economics and Management,China University of Geosciences,Wuhan 430074,China;2.School of Management,Xi’an Jiaotong University,Xi’an 710049,China)
Abstract:This paper studies the laying strategy of communication network with different objectives. To satisfy different requirements, distance matrix of network terminals is established, and transferred to an undirected weighed graph that is fully connected. According to the network design standard, considering only the shortest distance, model of Minimum Spanning Tree(MST) is developed, and solved with Prim algorithm to obtain the shortest routes. Based on the logical structure of minimum spanning tree, a stability degree constraint model is established and the laying scheme is given. Considering the integrated factors of network laying, Ant Colony Algorithm(ACA) is employed to get the connecting condition with different on-off rate of links, different number of links and maximum network traffic, and to obtain the corresponding laying routes.
Keywords:network laying  Minimum Spanning Tree(MST)  Prim algorithm  Ant Colony Algorithm(ACA)  combined optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号