基于分布式猴群算法的传感器优化布置方法研究  

DISTRIBUTED MONKEY ALGORITHM FOR OPTIMAL SENSOR PLACEMENT

作　　者：伊廷华[1] 张旭东[1] 李宏男[1] 

机构地区：[1]大连理工大学建设工程学部土木工程学院,辽宁大连116023

出　　处：《工程力学》2014年第3期93-100,共8页Engineering Mechanics

基　　金：国家自然科学基金委创新研究群体基金项目(51121005);国家优秀青年科学基金项目(51222806);国家自然科学基金面上项目(51178083)

摘　　要：建立了针对具有较多自由度的大型结构传感器优化布置的分布式猴群算法。通过引入双重编码的方式,克服了原猴群算法只能解决连续变量的缺陷;针对单个猴群全局搜索能力较弱的问题,提出了一种将初始化产生的大量猴子个体按照指定的方式分配到多个猴群进行同步并行搜索的方法;考虑原猴群算法能够跳出局部最优的特点以及和声算法较强的局部搜索能力,提出将每个猴群得到的初步最优解作为初始和声记忆库,采用基本和声算法进行二次搜索的方法,来获取传感器的最终布设方案。文末以大连国贸大厦为例,进行了参数敏感性分析以及传感器优化布置方案的选择,结果表明分布式猴群算法具有较强的全局寻优能力,非常适用于具有较多自由度的大型结构传感器优化布置。The distributed monkey algorithm is established for the optimal sensor placement of multi-degree- of-freedom large strucaxres. Firstly, the problem that the original monkey algorithm can only solve the problem of continuous variables is overcome by introducing the dual-structure coding method. Then, a new method is proposed that assigning large number of individual monkeys generated by the initialization to multi-group of monkeys in a specified way and performing the parallel search. Considering that the original monkey algorithm is able to step out local optimum while the harmony search algorithm has better local search capability, the two-step search algorithm is adopted based on the basic harmony search algorithm by collecting the preliminary optimum gotten by each group of monkeys as the original harmony memory to obtain the final sensor placement scheme. Finally, the parametric sensitivity analysis and the selection of sensor placement schemes are performed on the Dalian International Trade Mansion. The results show that the distributed monkey algorithm has better global search capability and it is applicable to the sensor placement of multiple-degree-of-freedom large structures.

关 键 词：传感器优化布置 分布式猴群算法 双重编码 和声算法 大连国贸大厦 

分 类 号：TU973.23[建筑科学—结构工程] O329[理学—一般力学与力学基础]