摘要
针对猴群算法收敛速度慢,易陷入局部最优等缺点,将混沌搜索策略引入猴群算法,提出了一种求解桥梁传感器优化布置问题的混沌猴群算法。该算法利用混沌变量产生初始猴群,并按照混沌原理加以扰动来增强猴群的多样性,提高算法全局搜索能力。对一座悬索桥进行传感器优化布置,结果表明:混沌猴群算法可以解决桥梁传感器优化布置问题,且较猴群算法寻优能力强。
In order to overcome defects of slow convergence speed and being easy to fall into local optimum of monkey algorithm, a chaotic monkey algorithm to solve problem of optimal placement of bridge sensor is proposed by introducing chaos search strategy. This algorithm generates initial monkeys by using chaos variable and increases the diversity of monkeys by adding some disturbance to improve global search capability. The chaotic monkey algorithm is applied in a pair of suspension bridge to carry out optimal sensor placement, the results verify that the chaotic algorithm can solve the problem and has better search capability when compared with monkey algorithm.
出处
《传感器与微系统》
CSCD
北大核心
2014年第10期104-107,共4页
Transducer and Microsystem Technologies
基金
甘肃省高等学校基本科研业务费资助项目(213054)
甘肃省教育厅科研项目(213027)
关键词
桥梁
传感器优化布置
猴群算法
混沌
bridge
optimal placement of sensor
monkey algorithm（MA）
chaos
