摘要
面对智能建筑、数字化城市对综合布线系统的需求,提出了一种基于多级并行蚁群算法的综合布线路径规划方法,并建立了数学模型,用于在满足约束条件下的最短路径寻优。寻优过程中将各设备之间的路径看成三维空间树,设备之间布线路径用曼哈顿距离衡量,各子系统布线最短路径就是以起始点设备为原点到多个终端信息点的最短路径和。以6层实训大楼某一工作区子系统为工程案例,进行仿真实验,数据结果表明算法平均达优率较高,鲁棒性指标较小,寻优过程稳定。针对6层78个工作区子系统的大数据综合布线项目,该多级并行寻优的蚁群算法同样能够在较短时间实现全局最优,收敛速度较快,寻优路径精准。
The comprehensive cabling system is the foundation for the rapid development of intelligent buildings and digital cities.From the workspace subsystem to the building cluster subsystem,there are multiple optional wiring paths between any two devices in each link.Consider the paths between devices as a three-dimensional spatial tree,and measure the wiring path distance between devices using Manhattan distance.The optimal path for the workspace subsystem is the optimal tree from the router device to multiple information points.This article proposes a comprehensive wiring path planning method based on multi-level parallel ant colony algorithm and establishes a mathematical model for optimizing the shortest path under constraint conditions.The experimental simulation shows that the multi-level parallel optimization ant colony algorithm can achieve global optimization in a short time,with fast convergence speed and precise optimization path.
作者
梁嘉伟
刘向勇
张俊强
Liang Jiawei;Liu Xiangyong;Zhang Junqiang(Zhongshan Technician College,Zhongshan,Guangdong 528400,China)
出处
《机电工程技术》
2023年第7期107-110,123,共5页
Mechanical & Electrical Engineering Technology
基金
2020年广东省技工教育和职业培训省级教学研究课题(KT2020028)
2022年中山市技工教育和职业培训省级教学研究课题(KTZSJG202203)。
关键词
综合布线
路径规划
蚁群算法
cabling system
path planning
ant colony algorithm
