Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic e...Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic environments.The effectiveness of interference suppression by FDA-MIMO is limited by the inherent range-angle coupling issue in the FDA beampattern.Existing literature primarily focuses on control methods for FDA-MIMO radar beam direction under the assumption of static beampatterns,with insufficient exploration of techniques for managing nonstationary beam directions.To address this gap,this paper initially introduces the FDA-MIMO signal model and the calculation formula for the FDA-MIMO array output using the minimum variance distortionless response(MVDR)beamformer.Building on this,the problem of determining the optimal frequency offset for the FDA is rephrased as a convex optimization problem,which is then resolved using the cuckoo search(CS)algorithm.Simulations confirm the effectiveness of the proposed approach,showing that the frequency offsets obtained through the CS algorithm can create a dot-shaped beam direction at the target location while effectively suppressing interference signals within the mainlobe.展开更多
This study proposes a Multi-Stage Sparrow Search Algorithm(MS-SSA)for precise structural damage identification.Initially,the structural static displacement sensitivity formulation is derived via the Sherman-Morrison-W...This study proposes a Multi-Stage Sparrow Search Algorithm(MS-SSA)for precise structural damage identification.Initially,the structural static displacement sensitivity formulation is derived via the Sherman-Morrison-Woodbury formula,and an objective function is constructed by integrating the sensitivity equations with the L2-norm penalty.Subsequently,MS-SSA is implemented to sequentially achieve preliminary damage localization and accurate quantification.In the localization phase,a constrained narrow-bound search space is predefined to identify potential damage regions.Leveraging this feedback,the sensitivity equations are condensed,and the search boundaries are adaptively refined for the quantification phase,where SSA is reapplied to precisely determine damage severity while mitigating misjudgments.TheMS-SSA framework exhibits two distinct advantages:(i)Phase I localization accelerates convergence by constraining the search space,as it does not target precise quantification;and(ii)the significant reduction in unknowns achieved by excluding intact elements in Phase II enables rapid convergence to the global optimum.Comparative studies against the GreyWolf Optimizer(GWO),Whale Optimization Algorithm(WOA),and standard SSA demonstrate that the proposed method effectively overcomes computational instability,slowconvergence,and large errors inherent in swarm intelligence optimization for damage identification.Specifically,numerical case studies reveal that the identification error is reduced to merely 9%~22%of that associated with existing methods,with experimental validation confirming reductions to 18%~22%.Overall,the proposed approach achieves high-fidelity damage identification while eliminating false positives and false negatives.展开更多
Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting incr...Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.展开更多
This paper proposes a novel approach for predicting the residual strength of corroded pipelines by combining the Kernel Extreme Learning Machine(KELM)with Sparrow Search Algorithm(SSA)optimization.The proposed SSA-KEL...This paper proposes a novel approach for predicting the residual strength of corroded pipelines by combining the Kernel Extreme Learning Machine(KELM)with Sparrow Search Algorithm(SSA)optimization.The proposed SSA-KELM model addresses the limitations of traditional evaluation methods and single machine learning models in residual strength prediction.A dataset comprising 80 samples from burst tests and finite element simulations was used to validate the model.Results demonstrate that the SSA-KELM model achieves superior prediction accuracy with a maximum relative error of 13.54%and minimum relative error of 0.20%.The model’s mean absolute error(MAE),root mean square error(RMSE),and mean absolute percentage error(MAPE)are 0.658%,0.780%,and 4.38%,respectively,significantly outperforming conventional machine learning models and traditional assessment methods.This research provides a reliable tool for evaluating pipeline integrity and maintenance planning.展开更多
The problem of collision avoidance for non-cooperative targets has received significant attention from researchers in recent years.Non-cooperative targets exhibit uncertain states and unpredictable behaviors,making co...The problem of collision avoidance for non-cooperative targets has received significant attention from researchers in recent years.Non-cooperative targets exhibit uncertain states and unpredictable behaviors,making collision avoidance significantly more challenging than that for space debris.Much existing research focuses on the continuous thrust model,whereas the impulsive maneuver model is more appropriate for long-duration and long-distance avoidance missions.Additionally,it is important to minimize the impact on the original mission while avoiding noncooperative targets.On the other hand,the existing avoidance algorithms are computationally complex and time-consuming especially with the limited computing capability of the on-board computer,posing challenges for practical engineering applications.To conquer these difficulties,this paper makes the following key contributions:(A)a turn-based(sequential decision-making)limited-area impulsive collision avoidance model considering the time delay of precision orbit determination is established for the first time;(B)a novel Selection Probability Learning Adaptive Search-depth Search Tree(SPL-ASST)algorithm is proposed for non-cooperative target avoidance,which improves the decision-making efficiency by introducing an adaptive-search-depth mechanism and a neural network into the traditional Monte Carlo Tree Search(MCTS).Numerical simulations confirm the effectiveness and efficiency of the proposed method.展开更多
A non-orthogonal multiple access(NOMA) power allocation scheme on the basis of the sparrow search algorithm(SSA) is proposed in this work. Specifically, the logarithmic utility function is utilized to address the pote...A non-orthogonal multiple access(NOMA) power allocation scheme on the basis of the sparrow search algorithm(SSA) is proposed in this work. Specifically, the logarithmic utility function is utilized to address the potential fairness issue that may arise from the maximum sum-rate based objective function and the optical power constraints are set considering the non-negativity of the transmit signal, the requirement of the human eyes safety and all users' quality of service(Qo S). Then, the SSA is utilized to solve this optimization problem. Moreover, to demonstrate the superiority of the proposed strategy, it is compared with the fixed power allocation(FPA) and the gain ratio power allocation(GRPA) schemes. Results show that regardless of the number of users considered, the sum-rate achieved by SSA consistently outperforms that of FPA and GRPA schemes. Specifically, compared to FPA and GRPA schemes, the sum-rate obtained by SSA is increased by 40.45% and 53.44% when the number of users is 7, respectively. The proposed SSA also has better performance in terms of user fairness. This work will benefit the design and development of the NOMA-visible light communication(VLC) systems.展开更多
Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,curr...Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,current SOH estimation methods often overlook the valuable temperature information that can effectively characterize battery aging during capacity degradation.Additionally,the Elman neural network,which is commonly employed for SOH estimation,exhibits several drawbacks,including slow training speed,a tendency to become trapped in local minima,and the initialization of weights and thresholds using pseudo-random numbers,leading to unstable model performance.To address these issues,this study addresses the challenge of precise and effective SOH detection by proposing a method for estimating the SOH of lithium-ion batteries based on differential thermal voltammetry(DTV)and an SSA-Elman neural network.Firstly,two health features(HFs)considering temperature factors and battery voltage are extracted fromthe differential thermal voltammetry curves and incremental capacity curves.Next,the Sparrow Search Algorithm(SSA)is employed to optimize the initial weights and thresholds of the Elman neural network,forming the SSA-Elman neural network model.To validate the performance,various neural networks,including the proposed SSA-Elman network,are tested using the Oxford battery aging dataset.The experimental results demonstrate that the method developed in this study achieves superior accuracy and robustness,with a mean absolute error(MAE)of less than 0.9%and a rootmean square error(RMSE)below 1.4%.展开更多
Deep learning algorithm is an effective data mining method and has been used in many fields to solve practical problems.However,the deep learning algorithms often contain some hyper-parameters which may be continuous,...Deep learning algorithm is an effective data mining method and has been used in many fields to solve practical problems.However,the deep learning algorithms often contain some hyper-parameters which may be continuous,integer,or mixed,and are often given based on experience but largely affect the effectiveness of activity recognition.In order to adapt to different hyper-parameter optimization problems,our improved Cuckoo Search(CS)algorithm is proposed to optimize the mixed hyper-parameters in deep learning algorithm.The algorithm optimizes the hyper-parameters in the deep learning model robustly,and intelligently selects the combination of integer type and continuous hyper-parameters that make the model optimal.Then,the mixed hyper-parameter in Convolutional Neural Network(CNN),Long-Short-Term Memory(LSTM)and CNN-LSTM are optimized based on the methodology on the smart home activity recognition datasets.Results show that the methodology can improve the performance of the deep learning model and whether we are experienced or not,we can get a better deep learning model using our method.展开更多
With the continuous improvement of the accuracy of geodetic deformation data,the inversion of seismic source parameters puts forward a higher demand for nonlinear inversion algorithms.In this research,an improved Spar...With the continuous improvement of the accuracy of geodetic deformation data,the inversion of seismic source parameters puts forward a higher demand for nonlinear inversion algorithms.In this research,an improved Sparrow Search Algorithm(SSA)is proposed for the seismic source parameter inversion problem.By replacing the original population generation in the improved algorithm with Latin hypercubic sampling,the Sparrow Search Algorithm reduces the repetition of samples in the population initialization.Subsequently,the algorithm introduces adaptive weights in the discoverer generation phase of the sparrow algorithm and combines the Levy flight strategy to make the algorithm more comprehensive and improve the search accuracy during the whole iteration process.Therefore,the improved Latin hypercube-based sparrow search algorithm(ILHSSA)has better advantages in terms of iterative convergence speed and stability.In order to verify the performance of ILHSSA,the basic genetic algorithm(GA)and sparrow search algorithm(SSA)are examined and compared with ILHSSA by simulated earthquakes of two different earthquake types.The simulation experiments show that the improved algorithm ILHSSA outperforms SSA in accuracy and stability.Compared with the GA algorithm,ILHSSA can achieve the same inversion accuracy as GA,and it even surpasses GA in inversion speed and the inversion results of some parameters,demonstrating better stability.Finally,the improved algorithm is used for the 2017 Bodrum-Cos earthquake and the 2016 Amatrice earthquake in Italy.The inversion results all reflect the practicality and reliability of the improved algorithm.展开更多
DNA microarrays, a cornerstone in biomedicine, measure gene expression across thousands to tens of thousands of genes. Identifying the genes vital for accurate cancer classification is a key challenge. Here, we presen...DNA microarrays, a cornerstone in biomedicine, measure gene expression across thousands to tens of thousands of genes. Identifying the genes vital for accurate cancer classification is a key challenge. Here, we present Fs-LSA (F-score based Learning Search Algorithm), a novel gene selection algorithm designed to enhance the precision and efficiency of target gene identification from microarray data for cancer classification. This algorithm is divided into two phases: the first leverages F-score values to prioritize and select feature genes with the most significant differential expression;the second phase introduces our Learning Search Algorithm (LSA), which harnesses swarm intelligence to identify the optimal subset among the remaining genes. Inspired by human social learning, LSA integrates historical data and collective intelligence for a thorough search, with a dynamic control mechanism that balances exploration and refinement, thereby enhancing the gene selection process. We conducted a rigorous validation of Fs-LSA’s performance using eight publicly available cancer microarray expression datasets. Fs-LSA achieved accuracy, precision, sensitivity, and F1-score values of 0.9932, 0.9923, 0.9962, and 0.994, respectively. Comparative analyses with state-of-the-art algorithms revealed Fs-LSA’s superior performance in terms of simplicity and efficiency. Additionally, we validated the algorithm’s efficacy independently using glioblastoma data from GEO and TCGA databases. It was significantly superior to those of the comparison algorithms. Importantly, the driver genes identified by Fs-LSA were instrumental in developing a predictive model as an independent prognostic indicator for glioblastoma, underscoring Fs-LSA’s transformative potential in genomics and personalized medicine.展开更多
Background Interconnection of different power systems has a major effect on system stability.This study aims to design an optimal load frequency control(LFC)system based on a proportional-integral(PI)controller for a ...Background Interconnection of different power systems has a major effect on system stability.This study aims to design an optimal load frequency control(LFC)system based on a proportional-integral(PI)controller for a two-area power system.Methods Two areas were connected through an AC tie line in parallel with a DC link to stabilize the frequency of oscillations in both areas.The PI parameters were tuned using the cuckoo search algorithm(CSA)to minimize the integral absolute error(IAE).A state matrix was provided,and the stability of the system was verified by calculating the eigenvalues.The frequency response was investigated for load variation,changes in the generator rate constraint,the turbine time constant,and the governor time constant.Results The CSA was compared with particle swarm optimization algorithm(PSO)under identical conditions.The system was modeled based on a state-space mathematical representation and simulated using MATLAB.The results demonstrated the effectiveness of the proposed controller based on both algorithms and,it is clear that CSA is superior to PSO.Conclusion The CSA algorithm smoothens the system response,reduces ripples,decreases overshooting and settling time,and improves the overall system performance under different disturbances.展开更多
Image enhancement utilizes intensity transformation functions to maximize the information content of enhanced images.This paper approaches the topic as an optimization problem and uses the bald eagle search(BES)algori...Image enhancement utilizes intensity transformation functions to maximize the information content of enhanced images.This paper approaches the topic as an optimization problem and uses the bald eagle search(BES)algorithm to achieve optimal results.In our proposed model,gamma correction and Retinex address color cast issues and enhance image edges and details.The final enhanced image is obtained through color balancing.The BES algorithm seeks the optimal solution through the selection,search,and swooping stages.However,it is prone to getting stuck in local optima and converges slowly.To overcome these limitations,we propose an improved BES algorithm(ABES)with enhanced population learning,position updates,and control parameters.ABES is employed to optimize the core parameters of gamma correction and Retinex to improve image quality,and the maximization of information entropy is utilized as the objective function.Real benchmark images are collected to validate its performance.Experimental results demonstrate that ABES outperforms the existing image enhancement methods,including the flower pollination algorithm,the chimp optimization algorithm,particle swarm optimization,and BES,in terms of information entropy,peak signal-to-noise ratio(PSNR),structural similarity index(SSIM),and patch-based contrast quality index(PCQI).ABES demonstrates superior performance both qualitatively and quantitatively,and it helps enhance prominent features and contrast in the images while maintaining the natural appearance of the original images.展开更多
Accurate and reliable photovoltaic(PV)modeling is crucial for the performance evaluation,control,and optimization of PV systems.However,existing methods for PV parameter identification often suffer from limitations in...Accurate and reliable photovoltaic(PV)modeling is crucial for the performance evaluation,control,and optimization of PV systems.However,existing methods for PV parameter identification often suffer from limitations in accuracy and efficiency.To address these challenges,we propose an adaptive multi-learning cooperation search algorithm(AMLCSA)for efficient identification of unknown parameters in PV models.AMLCSA is a novel algorithm inspired by teamwork behaviors in modern enterprises.It enhances the original cooperation search algorithm in two key aspects:(i)an adaptive multi-learning strategy that dynamically adjusts search ranges using adaptive weights,allowing better individuals to focus on local exploitation while guiding poorer individuals toward global exploration;and(ii)a chaotic grouping reflection strategy that introduces chaotic sequences to enhance population diversity and improve search performance.The effectiveness of AMLCSA is demonstrated on single-diode,double-diode,and three PV-module models.Simulation results show that AMLCSA offers significant advantages in convergence,accuracy,and stability compared to existing state-of-the-art algorithms.展开更多
Efficient optimization of well operations andadjustment strategies in large-scale waterflooding reservoirs is a high-dimensional and complex challenge due to strong decision coupling and reservoir heterogeneity.This s...Efficient optimization of well operations andadjustment strategies in large-scale waterflooding reservoirs is a high-dimensional and complex challenge due to strong decision coupling and reservoir heterogeneity.This study proposes a collaborative optimization framework that integrates multiple adjustment strategies,includinginfillwell drilling,shut-in of low-efficiency wells,and injectionproduction well conversion.A penalty mechanism is introduced tobalance cumulative oil production maximization with minimum production constraints for infill wells.The core contribution is the development of a multi-strategy enhancedadaptive differential evolution algorithm(E-ADE),which incorporates the follower update mechanism of the SparrowSearch Algorithm(SSA)and the logarithmic spiral search strategy of the Whale Optimization Algorithm(WOA)into the differential evolution(DE)framework.By dynamically adjusting differential evolution vectors and adaptively regulating population size across optimization stages,E-ADE effectively balances global exploration and local exploitation,leading to significantlyimproved convergence speed and optimization accuracy.Benchmark tests on nine multimodalfunctions demonstrate that E-ADEconsistently outperforms classical algorithms,includingDE,GA,PSO,WOA,and SSA.The method is further applied to the PUNQ-S3 reservoir model and the S4 block of the W12-2 oilfield under high water-cut conditions.The results indicate that E-ADE enables adaptive optimization of infillwell placement,shut-in schemes,and welltype conversions,achieving coordinated improvements in both field-scale production andsingle-well performance,and substantially enhancing the efficiency of waterflooding development.展开更多
The Agile Earth Observation Satellite Scheduling Problem(AEOSSP)is a complex NP‑hard challenge that involves selecting,sequencing,and timing observation tasks to maximize imaging profits while adhering to various cons...The Agile Earth Observation Satellite Scheduling Problem(AEOSSP)is a complex NP‑hard challenge that involves selecting,sequencing,and timing observation tasks to maximize imaging profits while adhering to various constraints.In our study,we developed a mixed‑integer programming model for AEOSSP,incorporating key constraints related to visible time windows and time dependencies.To tackle this,we propose an Evolutionary Adaptive Large Neighborhood Search Algorithm(evALNS)enhanced by Large Language Models(LLMs).Our work pioneers the application of LLMs to ALNS by being the first to automatically develop and evolve its critical destroy heuristics.However,a naive application of LLMs is insufficient for such a complex domain.We therefore introduce a novel Dual‑Population Co‑Evolutionary Computing Framework(DPEC)to bridge the LLM’s knowledge gap by synergizing LLM‑generated heuristics with expert‑designed ones.This co‑evolution,guided by a Functional Natural Language Embedding(FNLE)strategy and customized prompts,significantly enhances the adaptability and efficiency of ALNS.Extensive numerical experiments demonstrated the superiority of the evALNS evolved under our framework,achieving an average profit improvement of 8.48%compared to the original ALNS with expert‑designed destroy operators.展开更多
Many cognitive studies have indicated that the path simplicity may be as important as its distance travelled.However,the optimality of paths for current navigation system is often judged purely on the distance travell...Many cognitive studies have indicated that the path simplicity may be as important as its distance travelled.However,the optimality of paths for current navigation system is often judged purely on the distance travelled or time cost,and not the path simplicity.To balance these factors,this paper presented an algorithm to compute a path that not only possesses fewest turns but also is as short as possible by utilizing the breadth-first-search strategy.The proposed algorithm started searching from a starting point,and expanded layer by layer through searching zero-level reachable points until the endpoint is found,and then deleted unnecessary points in the reverse direction.The forward searching and backward cleaning strategies were presented to build a hierarchical graph of zero-level reachable points,and form a fewestturn-path graph(G*).After that,a classic Dijkstra shortest path algorithm was executed on the G* to obtain a fewestturn-and-shortest path.Comparing with the shortest path in Baidu map,the algorithm in this work has less than half of the turns but the nearly same length.The proposed fewest-turn-and-shortest path algorithm is proved to be more suitable for human beings according to human cognition research.展开更多
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.展开更多
The integration of renewable energy sources into modern power systems necessitates efficient and robust control strategies to address challenges such as power quality,stability,and dynamic environmental variations.Thi...The integration of renewable energy sources into modern power systems necessitates efficient and robust control strategies to address challenges such as power quality,stability,and dynamic environmental variations.This paper presents a novel sparrow search algorithm(SSA)-tuned proportional-integral(PI)controller for grid-connected photovoltaic(PV)systems,designed to optimize dynamic perfor-mance,energy extraction,and power quality.Key contributions include the development of a systematic SSA-based optimization frame-work for real-time PI parameter tuning,ensuring precise voltage and current regulation,improved maximum power point tracking(MPPT)efficiency,and minimized total harmonic distortion(THD).The proposed approach is evaluated against conventional PSO-based and P&O controllers through comprehensive simulations,demonstrating its superior performance across key metrics:a 39.47%faster response time compared to PSO,a 12.06%increase in peak active power relative to P&O,and a 52.38%reduction in THD,ensuring compliance with IEEE grid standards.Moreover,the SSA-tuned PI controller exhibits enhanced adaptability to dynamic irradiancefluc-tuations,rapid response time,and robust grid integration under varying conditions,making it highly suitable for real-time smart grid applications.This work establishes the SSA-tuned PI controller as a reliable and efficient solution for improving PV system performance in grid-connected scenarios,while also setting the foundation for future research into multi-objective optimization,experimental valida-tion,and hybrid renewable energy systems.展开更多
The Cross-domain Heuristic Search Challenge(CHeSC)is a competition focused on creating efficient search algorithms adaptable to diverse problem domains.Selection hyper-heuristics are a class of algorithms that dynamic...The Cross-domain Heuristic Search Challenge(CHeSC)is a competition focused on creating efficient search algorithms adaptable to diverse problem domains.Selection hyper-heuristics are a class of algorithms that dynamically choose heuristics during the search process.Numerous selection hyper-heuristics have different imple-mentation strategies.However,comparisons between them are lacking in the literature,and previous works have not highlighted the beneficial and detrimental implementation methods of different components.The question is how to effectively employ them to produce an efficient search heuristic.Furthermore,the algorithms that competed in the inaugural CHeSC have not been collectively reviewed.This work conducts a review analysis of the top twenty competitors from this competition to identify effective and ineffective strategies influencing algorithmic performance.A summary of the main characteristics and classification of the algorithms is presented.The analysis underlines efficient and inefficient methods in eight key components,including search points,search phases,heuristic selection,move acceptance,feedback,Tabu mechanism,restart mechanism,and low-level heuristic parameter control.This review analyzes the components referencing the competition’s final leaderboard and discusses future research directions for these components.The effective approaches,identified as having the highest quality index,are mixed search point,iterated search phases,relay hybridization selection,threshold acceptance,mixed learning,Tabu heuristics,stochastic restart,and dynamic parameters.Findings are also compared with recent trends in hyper-heuristics.This work enhances the understanding of selection hyper-heuristics,offering valuable insights for researchers and practitioners aiming to develop effective search algorithms for diverse problem domains.展开更多
Cluster-basedmodels have numerous application scenarios in vehicular ad-hoc networks(VANETs)and can greatly help improve the communication performance of VANETs.However,the frequent movement of vehicles can often lead...Cluster-basedmodels have numerous application scenarios in vehicular ad-hoc networks(VANETs)and can greatly help improve the communication performance of VANETs.However,the frequent movement of vehicles can often lead to changes in the network topology,thereby reducing cluster stability in urban scenarios.To address this issue,we propose a clustering model based on the density peak clustering(DPC)method and sparrow search algorithm(SSA),named SDPC.First,the model constructs a fitness function based on the parameters obtained from the DPC method and deploys the SSA for iterative optimization to select cluster heads(CHs).Then,the vehicles that have not been selected as CHs are assigned to appropriate clusters by comprehensively considering the distance parameter and link-reliability parameter.Finally,cluster maintenance strategies are considered to tackle the changes in the clusters’organizational structure.To verify the performance of the model,we conducted a simulation on a real-world scenario for multiple metrics related to clusters’stability.The results show that compared with the APROVE and the GAPC,SDPC showed clear performance advantages,indicating that SDPC can effectively ensure VANETs’cluster stability in urban scenarios.展开更多
基金supported by the National Natural Science Foundation of China(61503408)。
摘要Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic environments.The effectiveness of interference suppression by FDA-MIMO is limited by the inherent range-angle coupling issue in the FDA beampattern.Existing literature primarily focuses on control methods for FDA-MIMO radar beam direction under the assumption of static beampatterns,with insufficient exploration of techniques for managing nonstationary beam directions.To address this gap,this paper initially introduces the FDA-MIMO signal model and the calculation formula for the FDA-MIMO array output using the minimum variance distortionless response(MVDR)beamformer.Building on this,the problem of determining the optimal frequency offset for the FDA is rephrased as a convex optimization problem,which is then resolved using the cuckoo search(CS)algorithm.Simulations confirm the effectiveness of the proposed approach,showing that the frequency offsets obtained through the CS algorithm can create a dot-shaped beam direction at the target location while effectively suppressing interference signals within the mainlobe.
摘要This study proposes a Multi-Stage Sparrow Search Algorithm(MS-SSA)for precise structural damage identification.Initially,the structural static displacement sensitivity formulation is derived via the Sherman-Morrison-Woodbury formula,and an objective function is constructed by integrating the sensitivity equations with the L2-norm penalty.Subsequently,MS-SSA is implemented to sequentially achieve preliminary damage localization and accurate quantification.In the localization phase,a constrained narrow-bound search space is predefined to identify potential damage regions.Leveraging this feedback,the sensitivity equations are condensed,and the search boundaries are adaptively refined for the quantification phase,where SSA is reapplied to precisely determine damage severity while mitigating misjudgments.TheMS-SSA framework exhibits two distinct advantages:(i)Phase I localization accelerates convergence by constraining the search space,as it does not target precise quantification;and(ii)the significant reduction in unknowns achieved by excluding intact elements in Phase II enables rapid convergence to the global optimum.Comparative studies against the GreyWolf Optimizer(GWO),Whale Optimization Algorithm(WOA),and standard SSA demonstrate that the proposed method effectively overcomes computational instability,slowconvergence,and large errors inherent in swarm intelligence optimization for damage identification.Specifically,numerical case studies reveal that the identification error is reduced to merely 9%~22%of that associated with existing methods,with experimental validation confirming reductions to 18%~22%.Overall,the proposed approach achieves high-fidelity damage identification while eliminating false positives and false negatives.
基金supported in part by the Ministry of Higher Education Malaysia(MOHE)through Fundamental Research Grant Scheme(FRGS)Ref:FRGS/1/2024/ICT02/UTM/02/10,Vot.No:R.J130000.7828.5F748the Scientific Research Project of Education Department of Hunan Province(Nos.22B1046 and 24A0771).
摘要Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.
摘要This paper proposes a novel approach for predicting the residual strength of corroded pipelines by combining the Kernel Extreme Learning Machine(KELM)with Sparrow Search Algorithm(SSA)optimization.The proposed SSA-KELM model addresses the limitations of traditional evaluation methods and single machine learning models in residual strength prediction.A dataset comprising 80 samples from burst tests and finite element simulations was used to validate the model.Results demonstrate that the SSA-KELM model achieves superior prediction accuracy with a maximum relative error of 13.54%and minimum relative error of 0.20%.The model’s mean absolute error(MAE),root mean square error(RMSE),and mean absolute percentage error(MAPE)are 0.658%,0.780%,and 4.38%,respectively,significantly outperforming conventional machine learning models and traditional assessment methods.This research provides a reliable tool for evaluating pipeline integrity and maintenance planning.
基金co-supported by the Foundation of Shanghai Astronautics Science and Technology Innovation,China(No.SAST2022-114)the National Natural Science Foundation of China(No.62303378),the National Natural Science Foundation of China(Nos.124B2031,12202281)the Foundation of China National Key Laboratory of Science and Technology on Test Physics&Numerical Mathematics,China(No.08-YY-2023-R11)。
摘要The problem of collision avoidance for non-cooperative targets has received significant attention from researchers in recent years.Non-cooperative targets exhibit uncertain states and unpredictable behaviors,making collision avoidance significantly more challenging than that for space debris.Much existing research focuses on the continuous thrust model,whereas the impulsive maneuver model is more appropriate for long-duration and long-distance avoidance missions.Additionally,it is important to minimize the impact on the original mission while avoiding noncooperative targets.On the other hand,the existing avoidance algorithms are computationally complex and time-consuming especially with the limited computing capability of the on-board computer,posing challenges for practical engineering applications.To conquer these difficulties,this paper makes the following key contributions:(A)a turn-based(sequential decision-making)limited-area impulsive collision avoidance model considering the time delay of precision orbit determination is established for the first time;(B)a novel Selection Probability Learning Adaptive Search-depth Search Tree(SPL-ASST)algorithm is proposed for non-cooperative target avoidance,which improves the decision-making efficiency by introducing an adaptive-search-depth mechanism and a neural network into the traditional Monte Carlo Tree Search(MCTS).Numerical simulations confirm the effectiveness and efficiency of the proposed method.
基金supported by the Cooperative Research Project between China Coal Energy Research Institute Co.,Ltd. and Xidian University (No.N-KY-HX-1101-202302-00725)the Key Research and Development Program of Shaanxi Province (No.2017ZDCXL-GY-06-02)。
摘要A non-orthogonal multiple access(NOMA) power allocation scheme on the basis of the sparrow search algorithm(SSA) is proposed in this work. Specifically, the logarithmic utility function is utilized to address the potential fairness issue that may arise from the maximum sum-rate based objective function and the optical power constraints are set considering the non-negativity of the transmit signal, the requirement of the human eyes safety and all users' quality of service(Qo S). Then, the SSA is utilized to solve this optimization problem. Moreover, to demonstrate the superiority of the proposed strategy, it is compared with the fixed power allocation(FPA) and the gain ratio power allocation(GRPA) schemes. Results show that regardless of the number of users considered, the sum-rate achieved by SSA consistently outperforms that of FPA and GRPA schemes. Specifically, compared to FPA and GRPA schemes, the sum-rate obtained by SSA is increased by 40.45% and 53.44% when the number of users is 7, respectively. The proposed SSA also has better performance in terms of user fairness. This work will benefit the design and development of the NOMA-visible light communication(VLC) systems.
基金supported by the National Natural Science Foundation of China(NSFC)under Grant(No.51677058).
摘要Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,current SOH estimation methods often overlook the valuable temperature information that can effectively characterize battery aging during capacity degradation.Additionally,the Elman neural network,which is commonly employed for SOH estimation,exhibits several drawbacks,including slow training speed,a tendency to become trapped in local minima,and the initialization of weights and thresholds using pseudo-random numbers,leading to unstable model performance.To address these issues,this study addresses the challenge of precise and effective SOH detection by proposing a method for estimating the SOH of lithium-ion batteries based on differential thermal voltammetry(DTV)and an SSA-Elman neural network.Firstly,two health features(HFs)considering temperature factors and battery voltage are extracted fromthe differential thermal voltammetry curves and incremental capacity curves.Next,the Sparrow Search Algorithm(SSA)is employed to optimize the initial weights and thresholds of the Elman neural network,forming the SSA-Elman neural network model.To validate the performance,various neural networks,including the proposed SSA-Elman network,are tested using the Oxford battery aging dataset.The experimental results demonstrate that the method developed in this study achieves superior accuracy and robustness,with a mean absolute error(MAE)of less than 0.9%and a rootmean square error(RMSE)below 1.4%.
基金Supported by the Anhui Province Sports Health Information Monitoring Technology Engineering Research Center Open Project (KF2023012)。
摘要Deep learning algorithm is an effective data mining method and has been used in many fields to solve practical problems.However,the deep learning algorithms often contain some hyper-parameters which may be continuous,integer,or mixed,and are often given based on experience but largely affect the effectiveness of activity recognition.In order to adapt to different hyper-parameter optimization problems,our improved Cuckoo Search(CS)algorithm is proposed to optimize the mixed hyper-parameters in deep learning algorithm.The algorithm optimizes the hyper-parameters in the deep learning model robustly,and intelligently selects the combination of integer type and continuous hyper-parameters that make the model optimal.Then,the mixed hyper-parameter in Convolutional Neural Network(CNN),Long-Short-Term Memory(LSTM)and CNN-LSTM are optimized based on the methodology on the smart home activity recognition datasets.Results show that the methodology can improve the performance of the deep learning model and whether we are experienced or not,we can get a better deep learning model using our method.
基金funded by the National Natural Science Foundation of China(42174011).
摘要With the continuous improvement of the accuracy of geodetic deformation data,the inversion of seismic source parameters puts forward a higher demand for nonlinear inversion algorithms.In this research,an improved Sparrow Search Algorithm(SSA)is proposed for the seismic source parameter inversion problem.By replacing the original population generation in the improved algorithm with Latin hypercubic sampling,the Sparrow Search Algorithm reduces the repetition of samples in the population initialization.Subsequently,the algorithm introduces adaptive weights in the discoverer generation phase of the sparrow algorithm and combines the Levy flight strategy to make the algorithm more comprehensive and improve the search accuracy during the whole iteration process.Therefore,the improved Latin hypercube-based sparrow search algorithm(ILHSSA)has better advantages in terms of iterative convergence speed and stability.In order to verify the performance of ILHSSA,the basic genetic algorithm(GA)and sparrow search algorithm(SSA)are examined and compared with ILHSSA by simulated earthquakes of two different earthquake types.The simulation experiments show that the improved algorithm ILHSSA outperforms SSA in accuracy and stability.Compared with the GA algorithm,ILHSSA can achieve the same inversion accuracy as GA,and it even surpasses GA in inversion speed and the inversion results of some parameters,demonstrating better stability.Finally,the improved algorithm is used for the 2017 Bodrum-Cos earthquake and the 2016 Amatrice earthquake in Italy.The inversion results all reflect the practicality and reliability of the improved algorithm.
基金supported by the National Natural Science Foundation of China(Grant Number 62341210)Natural Science Foundation of Guangxi Province(Grant Number:2025GXNSFHA069267)Science and Technology Development Plan for Baise City(Grant Number 20233654).
摘要DNA microarrays, a cornerstone in biomedicine, measure gene expression across thousands to tens of thousands of genes. Identifying the genes vital for accurate cancer classification is a key challenge. Here, we present Fs-LSA (F-score based Learning Search Algorithm), a novel gene selection algorithm designed to enhance the precision and efficiency of target gene identification from microarray data for cancer classification. This algorithm is divided into two phases: the first leverages F-score values to prioritize and select feature genes with the most significant differential expression;the second phase introduces our Learning Search Algorithm (LSA), which harnesses swarm intelligence to identify the optimal subset among the remaining genes. Inspired by human social learning, LSA integrates historical data and collective intelligence for a thorough search, with a dynamic control mechanism that balances exploration and refinement, thereby enhancing the gene selection process. We conducted a rigorous validation of Fs-LSA’s performance using eight publicly available cancer microarray expression datasets. Fs-LSA achieved accuracy, precision, sensitivity, and F1-score values of 0.9932, 0.9923, 0.9962, and 0.994, respectively. Comparative analyses with state-of-the-art algorithms revealed Fs-LSA’s superior performance in terms of simplicity and efficiency. Additionally, we validated the algorithm’s efficacy independently using glioblastoma data from GEO and TCGA databases. It was significantly superior to those of the comparison algorithms. Importantly, the driver genes identified by Fs-LSA were instrumental in developing a predictive model as an independent prognostic indicator for glioblastoma, underscoring Fs-LSA’s transformative potential in genomics and personalized medicine.
基金Supported by the Russian Science Foundation(Agreement 23-41-10001,http://gffzz5363282ec1d94f2dswpxx599c9nbc665f.ffgz.tsg.suse.edu.cn/project/23-41-10001/).
摘要Background Interconnection of different power systems has a major effect on system stability.This study aims to design an optimal load frequency control(LFC)system based on a proportional-integral(PI)controller for a two-area power system.Methods Two areas were connected through an AC tie line in parallel with a DC link to stabilize the frequency of oscillations in both areas.The PI parameters were tuned using the cuckoo search algorithm(CSA)to minimize the integral absolute error(IAE).A state matrix was provided,and the stability of the system was verified by calculating the eigenvalues.The frequency response was investigated for load variation,changes in the generator rate constraint,the turbine time constant,and the governor time constant.Results The CSA was compared with particle swarm optimization algorithm(PSO)under identical conditions.The system was modeled based on a state-space mathematical representation and simulated using MATLAB.The results demonstrated the effectiveness of the proposed controller based on both algorithms and,it is clear that CSA is superior to PSO.Conclusion The CSA algorithm smoothens the system response,reduces ripples,decreases overshooting and settling time,and improves the overall system performance under different disturbances.
基金supported by the Research on theKey Technology of Damage Identification Method of Dam Concrete Structure based on Transformer Image Processing(242102521031)the project Research on Situational Awareness and Behavior Anomaly Prediction of Social Media Based on Multimodal Time Series Graph(232102520004)Key Scientific Research Project of Higher Education Institutions in Henan Province(25B520019).
摘要Image enhancement utilizes intensity transformation functions to maximize the information content of enhanced images.This paper approaches the topic as an optimization problem and uses the bald eagle search(BES)algorithm to achieve optimal results.In our proposed model,gamma correction and Retinex address color cast issues and enhance image edges and details.The final enhanced image is obtained through color balancing.The BES algorithm seeks the optimal solution through the selection,search,and swooping stages.However,it is prone to getting stuck in local optima and converges slowly.To overcome these limitations,we propose an improved BES algorithm(ABES)with enhanced population learning,position updates,and control parameters.ABES is employed to optimize the core parameters of gamma correction and Retinex to improve image quality,and the maximization of information entropy is utilized as the objective function.Real benchmark images are collected to validate its performance.Experimental results demonstrate that ABES outperforms the existing image enhancement methods,including the flower pollination algorithm,the chimp optimization algorithm,particle swarm optimization,and BES,in terms of information entropy,peak signal-to-noise ratio(PSNR),structural similarity index(SSIM),and patch-based contrast quality index(PCQI).ABES demonstrates superior performance both qualitatively and quantitatively,and it helps enhance prominent features and contrast in the images while maintaining the natural appearance of the original images.
基金supported by the National Natural Science Foundation of China(Grant Nos.62303197,62273214)the Natural Science Foundation of Shandong Province(ZR2024MFO18).
摘要Accurate and reliable photovoltaic(PV)modeling is crucial for the performance evaluation,control,and optimization of PV systems.However,existing methods for PV parameter identification often suffer from limitations in accuracy and efficiency.To address these challenges,we propose an adaptive multi-learning cooperation search algorithm(AMLCSA)for efficient identification of unknown parameters in PV models.AMLCSA is a novel algorithm inspired by teamwork behaviors in modern enterprises.It enhances the original cooperation search algorithm in two key aspects:(i)an adaptive multi-learning strategy that dynamically adjusts search ranges using adaptive weights,allowing better individuals to focus on local exploitation while guiding poorer individuals toward global exploration;and(ii)a chaotic grouping reflection strategy that introduces chaotic sequences to enhance population diversity and improve search performance.The effectiveness of AMLCSA is demonstrated on single-diode,double-diode,and three PV-module models.Simulation results show that AMLCSA offers significant advantages in convergence,accuracy,and stability compared to existing state-of-the-art algorithms.
基金supported by the Oil&Gas Major Project of China(2025ZD1402901).
摘要Efficient optimization of well operations andadjustment strategies in large-scale waterflooding reservoirs is a high-dimensional and complex challenge due to strong decision coupling and reservoir heterogeneity.This study proposes a collaborative optimization framework that integrates multiple adjustment strategies,includinginfillwell drilling,shut-in of low-efficiency wells,and injectionproduction well conversion.A penalty mechanism is introduced tobalance cumulative oil production maximization with minimum production constraints for infill wells.The core contribution is the development of a multi-strategy enhancedadaptive differential evolution algorithm(E-ADE),which incorporates the follower update mechanism of the SparrowSearch Algorithm(SSA)and the logarithmic spiral search strategy of the Whale Optimization Algorithm(WOA)into the differential evolution(DE)framework.By dynamically adjusting differential evolution vectors and adaptively regulating population size across optimization stages,E-ADE effectively balances global exploration and local exploitation,leading to significantlyimproved convergence speed and optimization accuracy.Benchmark tests on nine multimodalfunctions demonstrate that E-ADEconsistently outperforms classical algorithms,includingDE,GA,PSO,WOA,and SSA.The method is further applied to the PUNQ-S3 reservoir model and the S4 block of the W12-2 oilfield under high water-cut conditions.The results indicate that E-ADE enables adaptive optimization of infillwell placement,shut-in schemes,and welltype conversions,achieving coordinated improvements in both field-scale production andsingle-well performance,and substantially enhancing the efficiency of waterflooding development.
基金supported by the National Natural Science Foundation of China(Grant No.72201272 and 72501042)the Young Elite Scientists Sponsorship Program by CAST(Grant No.2023‑JCIQ‑QT‑042)The Science and Technology Innovation Program of Hunan Province(Grant No.2025RC3111).
摘要The Agile Earth Observation Satellite Scheduling Problem(AEOSSP)is a complex NP‑hard challenge that involves selecting,sequencing,and timing observation tasks to maximize imaging profits while adhering to various constraints.In our study,we developed a mixed‑integer programming model for AEOSSP,incorporating key constraints related to visible time windows and time dependencies.To tackle this,we propose an Evolutionary Adaptive Large Neighborhood Search Algorithm(evALNS)enhanced by Large Language Models(LLMs).Our work pioneers the application of LLMs to ALNS by being the first to automatically develop and evolve its critical destroy heuristics.However,a naive application of LLMs is insufficient for such a complex domain.We therefore introduce a novel Dual‑Population Co‑Evolutionary Computing Framework(DPEC)to bridge the LLM’s knowledge gap by synergizing LLM‑generated heuristics with expert‑designed ones.This co‑evolution,guided by a Functional Natural Language Embedding(FNLE)strategy and customized prompts,significantly enhances the adaptability and efficiency of ALNS.Extensive numerical experiments demonstrated the superiority of the evALNS evolved under our framework,achieving an average profit improvement of 8.48%compared to the original ALNS with expert‑designed destroy operators.
基金This research was supported by the National Natural Science Foundation of China(Nos.41471332 and 41101354)the National High Technology Research and Development Program of China(863 Program)(No.2013AA12A302)+1 种基金the Fundamental Research Funds for the Central Universities(No.ZYGX2011J077)the Fund of China Scholarship Council.
摘要Many cognitive studies have indicated that the path simplicity may be as important as its distance travelled.However,the optimality of paths for current navigation system is often judged purely on the distance travelled or time cost,and not the path simplicity.To balance these factors,this paper presented an algorithm to compute a path that not only possesses fewest turns but also is as short as possible by utilizing the breadth-first-search strategy.The proposed algorithm started searching from a starting point,and expanded layer by layer through searching zero-level reachable points until the endpoint is found,and then deleted unnecessary points in the reverse direction.The forward searching and backward cleaning strategies were presented to build a hierarchical graph of zero-level reachable points,and form a fewestturn-path graph(G*).After that,a classic Dijkstra shortest path algorithm was executed on the G* to obtain a fewestturn-and-shortest path.Comparing with the shortest path in Baidu map,the algorithm in this work has less than half of the turns but the nearly same length.The proposed fewest-turn-and-shortest path algorithm is proved to be more suitable for human beings according to human cognition research.
摘要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.
摘要The integration of renewable energy sources into modern power systems necessitates efficient and robust control strategies to address challenges such as power quality,stability,and dynamic environmental variations.This paper presents a novel sparrow search algorithm(SSA)-tuned proportional-integral(PI)controller for grid-connected photovoltaic(PV)systems,designed to optimize dynamic perfor-mance,energy extraction,and power quality.Key contributions include the development of a systematic SSA-based optimization frame-work for real-time PI parameter tuning,ensuring precise voltage and current regulation,improved maximum power point tracking(MPPT)efficiency,and minimized total harmonic distortion(THD).The proposed approach is evaluated against conventional PSO-based and P&O controllers through comprehensive simulations,demonstrating its superior performance across key metrics:a 39.47%faster response time compared to PSO,a 12.06%increase in peak active power relative to P&O,and a 52.38%reduction in THD,ensuring compliance with IEEE grid standards.Moreover,the SSA-tuned PI controller exhibits enhanced adaptability to dynamic irradiancefluc-tuations,rapid response time,and robust grid integration under varying conditions,making it highly suitable for real-time smart grid applications.This work establishes the SSA-tuned PI controller as a reliable and efficient solution for improving PV system performance in grid-connected scenarios,while also setting the foundation for future research into multi-objective optimization,experimental valida-tion,and hybrid renewable energy systems.
基金funded by Ministry of Higher Education(MoHE)Malaysia,under Transdisciplinary Research Grant Scheme(TRGS/1/2019/UKM/01/4/2).
摘要The Cross-domain Heuristic Search Challenge(CHeSC)is a competition focused on creating efficient search algorithms adaptable to diverse problem domains.Selection hyper-heuristics are a class of algorithms that dynamically choose heuristics during the search process.Numerous selection hyper-heuristics have different imple-mentation strategies.However,comparisons between them are lacking in the literature,and previous works have not highlighted the beneficial and detrimental implementation methods of different components.The question is how to effectively employ them to produce an efficient search heuristic.Furthermore,the algorithms that competed in the inaugural CHeSC have not been collectively reviewed.This work conducts a review analysis of the top twenty competitors from this competition to identify effective and ineffective strategies influencing algorithmic performance.A summary of the main characteristics and classification of the algorithms is presented.The analysis underlines efficient and inefficient methods in eight key components,including search points,search phases,heuristic selection,move acceptance,feedback,Tabu mechanism,restart mechanism,and low-level heuristic parameter control.This review analyzes the components referencing the competition’s final leaderboard and discusses future research directions for these components.The effective approaches,identified as having the highest quality index,are mixed search point,iterated search phases,relay hybridization selection,threshold acceptance,mixed learning,Tabu heuristics,stochastic restart,and dynamic parameters.Findings are also compared with recent trends in hyper-heuristics.This work enhances the understanding of selection hyper-heuristics,offering valuable insights for researchers and practitioners aiming to develop effective search algorithms for diverse problem domains.
摘要Cluster-basedmodels have numerous application scenarios in vehicular ad-hoc networks(VANETs)and can greatly help improve the communication performance of VANETs.However,the frequent movement of vehicles can often lead to changes in the network topology,thereby reducing cluster stability in urban scenarios.To address this issue,we propose a clustering model based on the density peak clustering(DPC)method and sparrow search algorithm(SSA),named SDPC.First,the model constructs a fitness function based on the parameters obtained from the DPC method and deploys the SSA for iterative optimization to select cluster heads(CHs).Then,the vehicles that have not been selected as CHs are assigned to appropriate clusters by comprehensively considering the distance parameter and link-reliability parameter.Finally,cluster maintenance strategies are considered to tackle the changes in the clusters’organizational structure.To verify the performance of the model,we conducted a simulation on a real-world scenario for multiple metrics related to clusters’stability.The results show that compared with the APROVE and the GAPC,SDPC showed clear performance advantages,indicating that SDPC can effectively ensure VANETs’cluster stability in urban scenarios.