邬贵昌, 韦文山, 李尚平, 郭羿, 吴超略. 基于混沌的多策略优化麻雀算法及应用[J]. 微电子学与计算机, 2022, 39(12): 21-30. DOI: 10.19304/J.ISSN1000-7180.2022.0223
引用本文: 邬贵昌, 韦文山, 李尚平, 郭羿, 吴超略. 基于混沌的多策略优化麻雀算法及应用[J]. 微电子学与计算机, 2022, 39(12): 21-30. DOI: 10.19304/J.ISSN1000-7180.2022.0223
WU Guichang, WEI Wenshan, LI Shangping, GUO Yi, WU Chaolue. Multi-strategy optimization sparrow search algorithm based on chaos and its application[J]. Microelectronics & Computer, 2022, 39(12): 21-30. DOI: 10.19304/J.ISSN1000-7180.2022.0223
Citation: WU Guichang, WEI Wenshan, LI Shangping, GUO Yi, WU Chaolue. Multi-strategy optimization sparrow search algorithm based on chaos and its application[J]. Microelectronics & Computer, 2022, 39(12): 21-30. DOI: 10.19304/J.ISSN1000-7180.2022.0223

基于混沌的多策略优化麻雀算法及应用

Multi-strategy optimization sparrow search algorithm based on chaos and its application

  • 摘要: 针对原始麻雀搜索算法在寻优过程中出现多样性降低,难以跳出局部最优,以及收敛精度不够等问题,提出一种基于混沌的多策略优化麻雀算法.首先,通过Circle混沌映射进行种群初始化, 生成分布更加均匀的麻雀种群,增加种群的多样性; 其次,引入自适应比例,对发现者的种群规模占种群总规模的比例进行动态变化,平衡算法的全局搜索与局部挖掘能力;然后引入Levy飞行改进发现者位置更新方式,提高算法的搜索范围与局部搜索能力,并且加快收敛于最优值的速度;最后,选择逐维变异与反向学习相融合的方式来扰动当前全局最优位置,通过贪婪算法来筛选出变异前后的最优值作为当前全局最优值,从而提高算法跳离局部最优的能力.本次选择12个基准函数和Wilcoxon秩和检验进行验证,并于六种其他算法进行对比,证明了以上多种策略对于算法的性能提升明显.同时,将该改进算法应用于工程实践中,本文选择压缩弹簧设计优化问题,验证所提改进算法在工程设计中的可行性与优越性.

     

    Abstract: Aiming at the problems that the diversity of the original sparrow search algorithm is reduced, it is difficult to jump out of the local optimization, and the convergence accuracy is not enough, a multi strategy optimization sparrow algorithm based on chaos is proposed. Firstly, the population is initialized by circle chaotic map to generate a more evenly distributed sparrow population and increase the diversity of the population; Secondly, the adaptive proportion is introduced to dynamically change the proportion of the population size of the discoverer to the total population size, so as to balance the global search and local mining ability of the algorithm; Then Levy flight is introduced to improve the location update method of the discoverer, improve the search range and local search ability of the algorithm, and accelerate the speed of convergence to the optimal value; Finally, the fusion of dimensional mutation and reverse learning is selected to disturb the current global optimal position, and the optimal value before and after mutation is selected as the current global optimal value by greedy algorithm, so as to improve the ability of the algorithm to jump away from the local optimal value. This time, 12 benchmark functions and Wilcoxon rank sum test are selected for verification, and compared with six other algorithms, which proves that the above strategies can significantly improve the performance of the algorithm. At the same time, the improved algorithm is applied to engineering practice. This paper selects compression spring design optimization problem to verify the feasibility and superiority of the proposed improved algorithm in engineering design.

     

/

返回文章
返回