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

Immune monkey algorithm for optimal sensor placement

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

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

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

基　　金：国家优秀青年科学基金(51222806);国家自然科学基金面上项目(51178083);教育部博士点基金(20130041110031)资助项目

摘　　要：将生物界中的免疫机制引入到猴群算法中,提出了一种用于传感器优化布置的免疫猴群算法。采用双重编码的方式,克服了原猴群算法只能解决连续变量优化问题的缺陷;采用混沌搜索的方式初始化猴群位置,以保证猴子能够均匀分布,提高了算法的全局搜索能力;通过在爬过程中引入深度爬的方式,增强了算法的局部搜索能力;在爬过程结束后加入基于浓度选择的机制对猴群进行初次选择,并对位置最优的猴子进行免疫克隆操作,以此保证猴群的多样性;在望过程结束后加入基于适应度的二次选择,并对位置较差的猴子进行免疫疫苗注射,以此提高算法的收敛能力。文末以大连世贸大厦为例,进行了参数敏感性分析以及传感器优化布置方案的选择,结果表明,免疫猴群算法的搜索效率较原猴群算法有了大幅提高,能较好地解决传感器优化布置问题。The immune monkey algorithm （IMA） for optimal sensor placement （OSP） is proposed by introducing the immune mechanism of biosphere into the monkey algorithm （MA）. The dual-structure coding method is used to overcome that the original MA can only solve the optimization of continuous variables. Then, the chaotic search is adopted to initialize the monkey＇s location for ensuring the uniform distribution of monkey,which can improve the global search capability. Besides,the deep climb is introduced in the climb process to enhance the local search capability of the algorithm. After the end of the climb process,the first selection by density-dependent mechanism on the monkey is performed and the immune clone is done on the monkeys with best location to guarantee the diversity of monkey. While af- ter the end of the watch process, the second selection is added based on the fitness and the immune vacci- nation is carried out on the monkeys with poor location to improve the convergence of the algorithm. Finally, the parametric sensitivity analysis and OSP is done on the Dalian world trade building. The results show that the search efficiency of the IMA greatly increases compared with the original MA, which can better solve the OSP problem.

关 键 词：传感器优化布置 猴群算法 免疫机制 大连世贸大厦 

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