基于多级并行蚁群算法的智能医疗建筑综合布线系统设计  

作　　者：凌杰 

机构地区：[1]上海邮电设计咨询研究院有限公司,上海200092

出　　处：《现代传输》2024年第2期76-79,共4页Modern Transmission

摘　　要：最小生成树算法(Minimum Spanning Tree,MST)是一种用于在加权连通图中找到最小生成树的算法。其目标是选择连接所有顶点并且边权重之和最小的边的子集。改进的A算法通过动态评估优先级来进行搜索。这种评估方式能够通过启发信息的引导。由于智能医疗建筑综合布线系统架构复杂,导致最小树算法、改进A*算法在安全方面较差,因此,提出基于多级并行蚁群算法的智能医疗建筑综合布线系统设计。在系统的硬件设计上,设计配线架,之后进入嵌入式处理器,最后到达随机存取存储器。在系统的软件设计上,构建医疗建筑综合布线路径的目标函数,根据目标函数,建立布线规划约束条件,完成基于多级并行蚁群算法的最优建筑预埋布线方案求解。对该系统进行性能测试,结果表明,该系统在耗时方面表现较为稳定,满足实际应用需求。The minimum spanning tree algorithm is an algorithm used to find the minimum spanning tree in a weighted connected graph.The goal is to select a subset of edges that connect all vertices and have the minimum sum of edge weights.The improved A algorithm performs search by dynamically evaluating priority.This evaluation method can be guided by heuristic information.Due to the complex architecture of the comprehensive cabling system for intelligent medical buildings,the minimum tree algorithm and improved A*algorithm have poor security.Therefore,a design of the comprehensive cabling system for intelligent medical buildings based on multi-level parallel ant colony algorithm is proposed.In the hardware design of the system,a distribution frame is designed,which then enters the embedded processor and finally reaches the random access memory.In the software design of the system,construct an objective function for the comprehensive wiring path of medical buildings,establish wiring planning constraints based on the objective function,and solve the optimal pre embedded wiring scheme for buildings based on multi-level parallel ant colony algorithm.The performance test of the system shows that it performs relatively stably in terms of time consumption and meets practical application requirements.

关 键 词：多级并行蚁群算法 智能医疗 建筑综合布线 系统设计 

分 类 号：TU855[建筑科学] TP18[自动化与计算机技术—控制理论与控制工程]