改进的混合蛙跳算法在传感器配置优化中的应用  

Application of Improved Shuffled Frog Leaping Algorithm in Optimum of Sensor Location

作　　者：刘晓芹[1,2] 黄考利[1] 安幼林[1] 吕晓明[1] 

机构地区：[1]军械工程学院,石家庄050003 [2]陆军航空兵学院,北京101123

出　　处：《计算机科学》2011年第2期72-75,81,共5页Computer Science

基　　金：军队保障科研项目"新型地空导弹装备测试性分析与验证技术研究"资助

摘　　要：传感器配置优化是可测性设计的重要研究内容,将混合蛙跳算法应用于传感器配置优化是一种新的尝试。针对传感器配置优化属于离散问题求解,提出离散的混合蛙跳算法,设计了一种离散化的更新方式。为克服蛙跳算法的早熟收敛问题,在改进的离散蛙跳算法中采用混沌优化算法以概率的形式对全局极值进行了优化。最后通过具体系统实例验证了该方法的正确性和有效性。Optimum of sensor location is an important research field in testability design,and it is a new attempt to use shuffled frog leaping algorithm for optimum of sensor location.Considering the optimal problem of sensor location is set in a space featuring discrete,a discrete shuffled frog leaping algorithm was proposed,and the change in position was re-defined discretely.To avoid converging too fast,the algorithm was improved.Chaos optimization algorithm was used to optimize the best solution in the form of probability.An example and simulation results were provided to verify the ef-fectiveness and practicability of this approach.

关 键 词：传感器配置优化 混合蛙跳算法 混沌优化算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]