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.展开更多
Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Fi...Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Firstly,the Golden Sine algorithm and a nonlinear weight factor optimization strategy were added in the discoverer position update stage of the SSA algorithm.Secondly,the Cauchy-Gaussian perturbation was applied to the optimal position of the SSA algorithm to improve its ability to jump out of local optima.Finally,the local search mechanism based on the mountain climbing method was incorporated into the local search stage of the SSA algorithm,improving its local search ability.To evaluate the effectiveness of the proposed algorithm,the Whale Algorithm,Gray Wolf Algorithm,Improved Gray Wolf Algorithm,Sparrow Search Algorithm,and MSSA Algorithm were employed to solve various test functions.The accuracy and convergence speed of each algorithm were then compared and analyzed.The results indicate that the MSSA algorithm has superior solving ability and stability compared to other algorithms.To further validate the enhanced algorithm’s capabilities for path planning,evacuation experiments were conducted using different maps featuring various obstacle types.Additionally,a multi-exit evacuation scenario was constructed according to the actual building environment of a teaching building.Both the sparrow search algorithm and MSSA algorithm were employed in the simulation experiment for multiexit evacuation path planning.The findings demonstrate that the MSSA algorithm outperforms the comparison algorithm,showcasing its greater advantages and higher application potential.展开更多
Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the p...Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the primary limitations of the original coati optimization algorithm(COA),notably its insufficient population diversity and propensity to become trapped in local optima.To address these issues,the ICOA integrates three innovative strategies:Latin hypercube sampling(LHS),Lévyflight,and an adaptive local search.LHS is employed to ensure a diverse initial population,thereby laying a foundation for the optimization.Lévy-flight is utilized to facilitate an efficient global search,enhancing the algorithm’s ability to explore the solution space.The adaptive local search is designed to refine solutions,enabling more precise local exploration.Together,these strategies significantly improve the population’s quality and diversity,thereby improving the algorithm’s convergence accuracy and optimization capabilities.The performance of the ICOA is tested against several established algorithms,using 12 benchmark functions.Additionally,the ICOA’s practicality and effectiveness are demonstrated through application to a real-world engineering problem,specifically the design optimization of tension/compression springs.Simulation results show that the ICOA consistently outperforms the other algorithms,providing robust solutions for a wide range of optimization problems.展开更多
In cloud computing, efficient multi-objective task scheduling, aiming at minimizing makespan, energy consumption,and load variance,remains a critical challenge due to the non-deterministic polynomial( NP)-completeness...In cloud computing, efficient multi-objective task scheduling, aiming at minimizing makespan, energy consumption,and load variance,remains a critical challenge due to the non-deterministic polynomial( NP)-completeness of the problem and the limitations of traditional algorithms like premature convergence. In this paper,a multi-strategy improved sparrow search algorithm( MISSA) was proposed to address these issues. MISSA integrates specular reflection learning for initial population optimization,nonlinear adaptive decay weights to balance global exploration and local exploitation,and an innovative strategy based on T-distribution mutation to enhance population diversity. Experimental results on benchmark functions and real cloud task scheduling scenarios using CloudSim demonstrate that MISSA outperforms comparative algorithms such as sparrow search algorithm( SSA),boosted sparrow search algorithm( BSSA),and genetic algorithm-grey wolf optimizer( GA-GWO),achieving significant reductions in makespan,energy consumption,and load variance. MISSA provides an effective solution for intelligent resource allocation in heterogeneous cloud environments,showcasing robust performance in complex multi-objective optimization tasks.展开更多
In the classification problem,deep kernel extreme learning machine(DKELM)has the characteristics of efficient processing and superior performance,but its parameters optimization is difficult.To improve the classificat...In the classification problem,deep kernel extreme learning machine(DKELM)has the characteristics of efficient processing and superior performance,but its parameters optimization is difficult.To improve the classification accuracy of DKELM,a DKELM algorithm optimized by the improved sparrow search algorithm(ISSA),named as ISSA-DKELM,is proposed in this paper.Aiming at the parameter selection problem of DKELM,the DKELM classifier is constructed by using the optimal parameters obtained by ISSA optimization.In order to make up for the shortcomings of the basic sparrow search algorithm(SSA),the chaotic transformation is first applied to initialize the sparrow position.Then,the position of the discoverer sparrow population is dynamically adjusted.A learning operator in the teaching-learning-based algorithm is fused to improve the position update operation of the joiners.Finally,the Gaussian mutation strategy is added in the later iteration of the algorithm to make the sparrow jump out of local optimum.The experimental results show that the proposed DKELM classifier is feasible and effective,and compared with other classification algorithms,the proposed DKELM algorithm aciheves better test accuracy.展开更多
光伏阵列P-U特性曲线在局部遮阴状态下呈现多峰状态,传统的最大功率追踪算法容易陷入局部最优状态。针对此问题,提出了一种基于改进麻雀搜索算法的最大功率点跟踪(maximum power point tracking,MPPT)方法。在麻雀搜索算法中引入遗传算...光伏阵列P-U特性曲线在局部遮阴状态下呈现多峰状态,传统的最大功率追踪算法容易陷入局部最优状态。针对此问题,提出了一种基于改进麻雀搜索算法的最大功率点跟踪(maximum power point tracking,MPPT)方法。在麻雀搜索算法中引入遗传算法和Lévy飞行策略,使算法的全局搜索能力得以增强,并且可以跳出局部最优解。在MATLAB/Simulink中建立仿真模型,并与粒子群优化算法和原始麻雀搜索算法进行比较。仿真结果表明,基于改进麻雀搜索算法的MPPT方法在不同光照条件下均显示出更高的效率和稳定性。展开更多
文摘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.
基金supported by National Natural Science Foundation of China(71904006)Henan Province Key R&D Special Project(231111322200)+1 种基金the Science and Technology Research Plan of Henan Province(232102320043,232102320232,232102320046)the Natural Science Foundation of Henan(232300420317,232300420314).
文摘Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Firstly,the Golden Sine algorithm and a nonlinear weight factor optimization strategy were added in the discoverer position update stage of the SSA algorithm.Secondly,the Cauchy-Gaussian perturbation was applied to the optimal position of the SSA algorithm to improve its ability to jump out of local optima.Finally,the local search mechanism based on the mountain climbing method was incorporated into the local search stage of the SSA algorithm,improving its local search ability.To evaluate the effectiveness of the proposed algorithm,the Whale Algorithm,Gray Wolf Algorithm,Improved Gray Wolf Algorithm,Sparrow Search Algorithm,and MSSA Algorithm were employed to solve various test functions.The accuracy and convergence speed of each algorithm were then compared and analyzed.The results indicate that the MSSA algorithm has superior solving ability and stability compared to other algorithms.To further validate the enhanced algorithm’s capabilities for path planning,evacuation experiments were conducted using different maps featuring various obstacle types.Additionally,a multi-exit evacuation scenario was constructed according to the actual building environment of a teaching building.Both the sparrow search algorithm and MSSA algorithm were employed in the simulation experiment for multiexit evacuation path planning.The findings demonstrate that the MSSA algorithm outperforms the comparison algorithm,showcasing its greater advantages and higher application potential.
基金supported by the Natural Science Foundation of Hunan Province of China(Nos.2021JJ10045 and 2025JJ60072)the Open Research Subject of State Key Laboratory of Intelligent Game(No.ZBKF-24-01)+1 种基金the Postdoctoral Fellowship Program of CPSF(No.GZB20240989)the China Postdoctoral Science Foundation(No.2024M754304).
文摘Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the primary limitations of the original coati optimization algorithm(COA),notably its insufficient population diversity and propensity to become trapped in local optima.To address these issues,the ICOA integrates three innovative strategies:Latin hypercube sampling(LHS),Lévyflight,and an adaptive local search.LHS is employed to ensure a diverse initial population,thereby laying a foundation for the optimization.Lévy-flight is utilized to facilitate an efficient global search,enhancing the algorithm’s ability to explore the solution space.The adaptive local search is designed to refine solutions,enabling more precise local exploration.Together,these strategies significantly improve the population’s quality and diversity,thereby improving the algorithm’s convergence accuracy and optimization capabilities.The performance of the ICOA is tested against several established algorithms,using 12 benchmark functions.Additionally,the ICOA’s practicality and effectiveness are demonstrated through application to a real-world engineering problem,specifically the design optimization of tension/compression springs.Simulation results show that the ICOA consistently outperforms the other algorithms,providing robust solutions for a wide range of optimization problems.
基金supported by the Key Research and Development Project of Heilongjiang Province (JD2023SJ20)。
文摘In cloud computing, efficient multi-objective task scheduling, aiming at minimizing makespan, energy consumption,and load variance,remains a critical challenge due to the non-deterministic polynomial( NP)-completeness of the problem and the limitations of traditional algorithms like premature convergence. In this paper,a multi-strategy improved sparrow search algorithm( MISSA) was proposed to address these issues. MISSA integrates specular reflection learning for initial population optimization,nonlinear adaptive decay weights to balance global exploration and local exploitation,and an innovative strategy based on T-distribution mutation to enhance population diversity. Experimental results on benchmark functions and real cloud task scheduling scenarios using CloudSim demonstrate that MISSA outperforms comparative algorithms such as sparrow search algorithm( SSA),boosted sparrow search algorithm( BSSA),and genetic algorithm-grey wolf optimizer( GA-GWO),achieving significant reductions in makespan,energy consumption,and load variance. MISSA provides an effective solution for intelligent resource allocation in heterogeneous cloud environments,showcasing robust performance in complex multi-objective optimization tasks.
文摘In the classification problem,deep kernel extreme learning machine(DKELM)has the characteristics of efficient processing and superior performance,but its parameters optimization is difficult.To improve the classification accuracy of DKELM,a DKELM algorithm optimized by the improved sparrow search algorithm(ISSA),named as ISSA-DKELM,is proposed in this paper.Aiming at the parameter selection problem of DKELM,the DKELM classifier is constructed by using the optimal parameters obtained by ISSA optimization.In order to make up for the shortcomings of the basic sparrow search algorithm(SSA),the chaotic transformation is first applied to initialize the sparrow position.Then,the position of the discoverer sparrow population is dynamically adjusted.A learning operator in the teaching-learning-based algorithm is fused to improve the position update operation of the joiners.Finally,the Gaussian mutation strategy is added in the later iteration of the algorithm to make the sparrow jump out of local optimum.The experimental results show that the proposed DKELM classifier is feasible and effective,and compared with other classification algorithms,the proposed DKELM algorithm aciheves better test accuracy.
文摘光伏阵列P-U特性曲线在局部遮阴状态下呈现多峰状态,传统的最大功率追踪算法容易陷入局部最优状态。针对此问题,提出了一种基于改进麻雀搜索算法的最大功率点跟踪(maximum power point tracking,MPPT)方法。在麻雀搜索算法中引入遗传算法和Lévy飞行策略,使算法的全局搜索能力得以增强,并且可以跳出局部最优解。在MATLAB/Simulink中建立仿真模型,并与粒子群优化算法和原始麻雀搜索算法进行比较。仿真结果表明,基于改进麻雀搜索算法的MPPT方法在不同光照条件下均显示出更高的效率和稳定性。
