通讯网络连接的最短路径问题探究  

Research on the Shortest Path of Communication Network Connection

作　　者：陈宏 

机构地区：[1]武警工程大学基础部,陕西 西安

出　　处：《应用数学进展》2024年第5期2451-2459,共9页Advances in Applied Mathematics

摘　　要：本文研究了旅行商模型(TSP)的蚁群法算法和树模型的最小生成树法,构建了139个节点的通讯网络线路,结果表明采用TSP模型的蚁群法得到单连通网络线路总长度在320附近,低于平均值;而树模型的最小生成树法得到了更佳优化的具有唯一性的网络连接线路,其总路径最小值为254。从网络连接图中明显的看出后者在连通性和抗摧毁性上明显的优于前者。In this paper, the Ant Clony Optimization of the Travelling Salesman Problem (TSP) and the Minimum Spanning Tree of the tree model was studied. Communication network lines with 139 nodes are constructed. The results show that the total length of simply connected network lines obtained by Ant Clony Optimization is around 320, which is lower than the average. The Minimum Spanning Tree has a better simply connected network lines, and its total path minimum value is 254. It is clear from the network connection diagram that the latter is significantly superior to the former in terms of connectivity and destructibility.

关 键 词：通讯网络 最小生成树 蚁群算法 最短路径 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]