基于禁忌搜索的入侵杂草算法在稀布阵列天线综合中的应用  

Application of Invasive Weed Algorithm Based on Tabu Search in Thinned Array Antenna Synthesis

作　　者：贾洪帅 曹顺锋 袁建涛[1] Jia Hong-shuai;Cao Shun-feng;Yuan Jian-tao(China Airborne Missile Academy,Henan Luoyang 471009)

机构地区：[1]中国空空导弹研究院,河南洛阳471009

出　　处：《电子质量》2019年第2期42-45,共4页Electronics Quality

摘　　要：该文提出了一种基于禁忌搜索的入侵杂草算法。针对入侵杂草算法在处理高维数问题时收敛速度慢、容易陷入局部最优的不足,通过引入禁忌搜索算法,利用禁忌搜索较强的"爬山"能力,增大了获得全局最优解的概率,从而有效地平衡了全局及局部搜索能力。将该算法应用于稀布阵列天线综合中,能够有效降低最大副瓣电平,仿真计算结果证明了该算法的有效性。This paper proposes an invasive weed algorithm based on tabu search.Aiming at the insufficiency of the invasive weed algorithm in dealing with high-dimensional problems,the convergence speed is slow and it is easy to fall into the local optimum.By introducing the tabu search algorithm,the tabu search is used to strengthen the"climbing"ability,which increases the probability of obtain the global optimal solution,thus effectively balancing global and local search capabilities.The algorithm is applied to the synthesis of thinned array antennas,which can effectively reduce the maximum sidelobe level.The simulation results show the effectiveness of the algorithm.

关 键 词：入侵杂草算法 禁忌搜索 稀布阵 优化布阵 

分 类 号：TJ765.3[兵器科学与技术—武器系统与运用工程] TN820[电子电信—信息与通信工程]