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

Research on optimal sensor placement based on improved monkey algorithm

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

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

出　　处：《计算力学学报》2013年第2期218-223,共6页Chinese Journal of Computational Mechanics

基　　金：国家自然科学基金委创新研究群体基金(51121005);国家优秀青年科学基金(51222806);国家自然科学基金(51178083);教育部新世纪优秀人才支持计划(NCET-10-0287)资助项目

摘　　要：提出了一种基于新型智能算法-改进猴群算法的传感器优化布置方法。考虑传感器优化布置的特点,采用整数编码的方式给出了猴群的位置,克服了猴群算法只能解决连续性变量优化的问题;在初始化猴群位置时通过引入欧氏距离来增强猴群的多样性,以提高其全局搜索能力;并在爬过程中加入和声算法中的随机扰动机制,来提高其局部搜索能力;文末以大连世贸大厦为例,进行了参数敏感性分析以及传感器优化布置方案的选择。结果表明,改进的猴群算法能较好地解决传感器优化布置问题,较经典的序列法有其明显的优越性。An optimal sensor placement （OSP） method based on a new intelligent algorithm,i, e. ,monkey algorithm （MA） is proposed. Considering the characteristics of the OSP,the location of the monkeys is given by integer encoding,which overcomes the problem that the MA can only solve the optimization of variables with continuity. The diversity of the monkeys is increased by introducing the Euclidean distance in the initial location, in order to improve the capacity of global search, and the random disturbance mech- anism of the Harmony search is introduced in the process of climbing to improve the capacity of local search. Finally,taking the Dalian World Trade Building as an example,the parametric sensitivity is ana- lyzed and the OSP schemes are chosen. The results show that the improved MA can better solve the problem of OSP,which has obvious advantages compared with the classical sequential sensor placement algorithm.

关 键 词：传感器优化布置 猴群算法 整数编码 欧氏距离 随机扰动 

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