It is evident that complex optimization problems are becoming increasingly prominent,metaheuristic algorithms have demonstrated unique advantages in solving high-dimensional,nonlinear problems.However,the traditional ...It is evident that complex optimization problems are becoming increasingly prominent,metaheuristic algorithms have demonstrated unique advantages in solving high-dimensional,nonlinear problems.However,the traditional Sparrow Search Algorithm(SSA)suffers from limited global search capability,insufficient population diversity,and slow convergence,which often leads to premature stagnation in local optima.Despite the proposal of various enhanced versions,the effective balancing of exploration and exploitation remains an unsolved challenge.To address the previously mentioned problems,this study proposes a multi-strategy collaborative improved SSA,which systematically integrates four complementary strategies:(1)the Northern Goshawk Optimization(NGO)mechanism enhances global exploration through guided prey-attacking dynamics;(2)an adaptive t-distribution mutation strategy balances the transition between exploration and exploitation via dynamic adjustment of the degrees of freedom;(3)a dual chaotic initialization method(Bernoulli and Sinusoidal maps)increases population diversity and distribution uniformity;and(4)an elite retention strategy maintains solution quality and prevents degradation during iterations.These strategies cooperate synergistically,forming a tightly coupled optimization framework that significantly improves search efficiency and robustness.Therefore,this paper names it NTSSA:A Novel Multi-Strategy Enhanced Sparrow Search Algorithm with Northern Goshawk Optimization and Adaptive t-Distribution for Global Optimization.Extensive experiments on the CEC2005 benchmark set demonstrate that NTSSA achieves theoretical optimal accuracy on unimodal functions and significantly enhances global optimum discovery for multimodal functions by 2–5 orders of magnitude.Compared with SSA,GWO,ISSA,and CSSOA,NTSSA improves solution accuracy by up to 14.3%(F8)and 99.8%(F12),while accelerating convergence by approximately 1.5–2×.The Wilcoxon rank-sum test(p<0.05)indicates that NTSSA demonstrates a statistically substantial performance advantage.Theoretical analysis demonstrates that the collaborative synergy among adaptive mutation,chaos-based diversification,and elite preservation ensures both high convergence accuracy and global stability.This work bridges a key research gap in SSA by realizing a coordinated optimization mechanism between exploration and exploitation,offering a robust and efficient solution framework for complex high-dimensional problems in intelligent computation and engineering design.展开更多
【目的】针对极限学习机(ELM)神经网络在室内可见光定位(VLP)中收敛不稳定,易陷入局部最优状态,导致定位精度降低的问题,文章引入了麻雀搜索算法(SSA)确定ELM神经网络的初始权值和阈值,提出了SSA-ELM神经网络算法。【方法】首先,采集定...【目的】针对极限学习机(ELM)神经网络在室内可见光定位(VLP)中收敛不稳定,易陷入局部最优状态,导致定位精度降低的问题,文章引入了麻雀搜索算法(SSA)确定ELM神经网络的初始权值和阈值,提出了SSA-ELM神经网络算法。【方法】首先,采集定位区域内接收信号强度(RSS)与位置信息作为指纹数据;然后,训练SSA-ELM神经网络并得到预测模型,将测试集数据输入预测模型得到待测位置的定位结果;最后,设计了仿真实验和测试平台。【结果】仿真表明,在立体空间模型中0、0.3、0.6和0.9 m 4个接收高度,平均误差分别为1.73、1.86、2.18和3.47 cm,与反向传播(BP)、SSA-BP和ELM定位算法相比,SSA-ELM神经网络算法定位精度分别提高了83.55%、45.71%和26.26%,定位时间分别降低了36.48%、17.69%和6.61%。实验测试表明,文章所提SSA-ELM神经网络算法的平均定位误差为3.75 cm,比未优化的ELM神经网络定位精度提高了16.38%。【结论】SSA对ELM神经网络具有明显的优化作用,能够显著降低定位误差,减少定位时间。展开更多
This paper presents a novel multiple Unmanned Aerial Vehicles（UAVs） reconnaissance task allocation model for heterogeneous targets and an effective genetic algorithm to optimize UAVs＇ task sequence. Heterogeneous t...This paper presents a novel multiple Unmanned Aerial Vehicles（UAVs） reconnaissance task allocation model for heterogeneous targets and an effective genetic algorithm to optimize UAVs＇ task sequence. Heterogeneous targets are classified into point targets, line targets and area targets according to features of target geometry and sensor＇s field of view. Each UAV is regarded as a Dubins vehicle to consider the kinematic constraints. And the objective of task allocation is to minimize the task execution time and UAVs＇ total consumptions. Then, multi-UAV reconnaissance task allocation is formulated as an extended Multiple Dubins Travelling Salesmen Problem（MDTSP）, where visit paths to the heterogeneous targets must meet specific constraints due to the targets＇ feature. As a complex combinatorial optimization problem, the dimensions of MDTSP are further increased due to the heterogeneity of targets. To efficiently solve this computationally expensive problem, the Opposition-based Genetic Algorithm using Double-chromosomes Encoding and Multiple Mutation Operators（OGA-DEMMO） is developed to improve the population variety for enhancing the global exploration capability. The simulation results demonstrate that OGADEMMO outperforms the ordinary genetic algorithm, ant colony optimization and random search in terms of optimality of the allocation results, especially for large scale reconnaissance task allocation problems.展开更多
文摘It is evident that complex optimization problems are becoming increasingly prominent,metaheuristic algorithms have demonstrated unique advantages in solving high-dimensional,nonlinear problems.However,the traditional Sparrow Search Algorithm(SSA)suffers from limited global search capability,insufficient population diversity,and slow convergence,which often leads to premature stagnation in local optima.Despite the proposal of various enhanced versions,the effective balancing of exploration and exploitation remains an unsolved challenge.To address the previously mentioned problems,this study proposes a multi-strategy collaborative improved SSA,which systematically integrates four complementary strategies:(1)the Northern Goshawk Optimization(NGO)mechanism enhances global exploration through guided prey-attacking dynamics;(2)an adaptive t-distribution mutation strategy balances the transition between exploration and exploitation via dynamic adjustment of the degrees of freedom;(3)a dual chaotic initialization method(Bernoulli and Sinusoidal maps)increases population diversity and distribution uniformity;and(4)an elite retention strategy maintains solution quality and prevents degradation during iterations.These strategies cooperate synergistically,forming a tightly coupled optimization framework that significantly improves search efficiency and robustness.Therefore,this paper names it NTSSA:A Novel Multi-Strategy Enhanced Sparrow Search Algorithm with Northern Goshawk Optimization and Adaptive t-Distribution for Global Optimization.Extensive experiments on the CEC2005 benchmark set demonstrate that NTSSA achieves theoretical optimal accuracy on unimodal functions and significantly enhances global optimum discovery for multimodal functions by 2–5 orders of magnitude.Compared with SSA,GWO,ISSA,and CSSOA,NTSSA improves solution accuracy by up to 14.3%(F8)and 99.8%(F12),while accelerating convergence by approximately 1.5–2×.The Wilcoxon rank-sum test(p<0.05)indicates that NTSSA demonstrates a statistically substantial performance advantage.Theoretical analysis demonstrates that the collaborative synergy among adaptive mutation,chaos-based diversification,and elite preservation ensures both high convergence accuracy and global stability.This work bridges a key research gap in SSA by realizing a coordinated optimization mechanism between exploration and exploitation,offering a robust and efficient solution framework for complex high-dimensional problems in intelligent computation and engineering design.
文摘【目的】针对极限学习机(ELM)神经网络在室内可见光定位(VLP)中收敛不稳定,易陷入局部最优状态,导致定位精度降低的问题,文章引入了麻雀搜索算法(SSA)确定ELM神经网络的初始权值和阈值,提出了SSA-ELM神经网络算法。【方法】首先,采集定位区域内接收信号强度(RSS)与位置信息作为指纹数据;然后,训练SSA-ELM神经网络并得到预测模型,将测试集数据输入预测模型得到待测位置的定位结果;最后,设计了仿真实验和测试平台。【结果】仿真表明,在立体空间模型中0、0.3、0.6和0.9 m 4个接收高度,平均误差分别为1.73、1.86、2.18和3.47 cm,与反向传播(BP)、SSA-BP和ELM定位算法相比,SSA-ELM神经网络算法定位精度分别提高了83.55%、45.71%和26.26%,定位时间分别降低了36.48%、17.69%和6.61%。实验测试表明,文章所提SSA-ELM神经网络算法的平均定位误差为3.75 cm,比未优化的ELM神经网络定位精度提高了16.38%。【结论】SSA对ELM神经网络具有明显的优化作用,能够显著降低定位误差,减少定位时间。
基金co-supported by the National Natural Science Foundation of China (Nos. 51675047, 11372036, and 51105040)the Aeronautical Science Foundation of China (No. 2015ZA72004)
文摘This paper presents a novel multiple Unmanned Aerial Vehicles（UAVs） reconnaissance task allocation model for heterogeneous targets and an effective genetic algorithm to optimize UAVs＇ task sequence. Heterogeneous targets are classified into point targets, line targets and area targets according to features of target geometry and sensor＇s field of view. Each UAV is regarded as a Dubins vehicle to consider the kinematic constraints. And the objective of task allocation is to minimize the task execution time and UAVs＇ total consumptions. Then, multi-UAV reconnaissance task allocation is formulated as an extended Multiple Dubins Travelling Salesmen Problem（MDTSP）, where visit paths to the heterogeneous targets must meet specific constraints due to the targets＇ feature. As a complex combinatorial optimization problem, the dimensions of MDTSP are further increased due to the heterogeneity of targets. To efficiently solve this computationally expensive problem, the Opposition-based Genetic Algorithm using Double-chromosomes Encoding and Multiple Mutation Operators（OGA-DEMMO） is developed to improve the population variety for enhancing the global exploration capability. The simulation results demonstrate that OGADEMMO outperforms the ordinary genetic algorithm, ant colony optimization and random search in terms of optimality of the allocation results, especially for large scale reconnaissance task allocation problems.
