Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion...Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.展开更多
Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises stru...Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises structural weight under stress and frequency constraints.Two new algorithms,the Red Kite Optimization Algorithm(ROA)and Secretary Bird Optimization Algorithm(SBOA),are utilized on five benchmark trusses with 10,18,37,72,and 200-bar trusses.Both algorithms are evaluated against benchmarks in the literature.The results indicate that SBOA always reaches a lighter optimal.Designs with reducing structural weight ranging from 0.02%to 0.15%compared to ROA,and up to 6%–8%as compared to conventional algorithms.In addition,SBOA can achieve 15%–20%faster convergence speed and 10%–18%reduction in computational time with a smaller standard deviation over independent runs,which demonstrates its robustness and reliability.It is indicated that the adaptive exploration mechanism of SBOA,especially its Levy flight–based search strategy,can obviously improve optimization performance for low-and high-dimensional trusses.The research has implications in the context of promoting bio-inspired optimization techniques by demonstrating the viability of SBOA,a reliable model for large-scale structural design that provides significant enhancements in performance and convergence behavior.展开更多
Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(...Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(SFOA)is a recently optimizer inspired by swarm intelligence,which is effective for numerical optimization,but it may encounter premature and local convergence for complex optimization problems.To address these challenges,this paper proposes the multi-strategy enhanced crested porcupine-starfish optimization algorithm(MCPSFOA).The core innovation of MCPSFOA lies in employing a hybrid strategy to improve SFOA,which integrates the exploratory mechanisms of SFOA with the diverse search capacity of the Crested Porcupine Optimizer(CPO).This synergy enhances MCPSFOA’s ability to navigate complex and multimodal search spaces.To further prevent premature convergence,MCPSFOA incorporates Lévy flight,leveraging its characteristic long and short jump patterns to enable large-scale exploration and escape from local optima.Subsequently,Gaussian mutation is applied for precise solution tuning,introducing controlled perturbations that enhance accuracy and mitigate the risk of insufficient exploitation.Notably,the population diversity enhancement mechanism periodically identifies and resets stagnant individuals,thereby consistently revitalizing population variety throughout the optimization process.MCPSFOA is rigorously evaluated on 24 classical benchmark functions(including high-dimensional cases),the CEC2017 suite,and the CEC2022 suite.MCPSFOA achieves superior overall performance with Friedman mean ranks of 2.208,2.310 and 2.417 on these benchmark functions,outperforming 11 state-of-the-art algorithms.Furthermore,the practical applicability of MCPSFOA is confirmed through its successful application to five engineering optimization cases,where it also yields excellent results.In conclusion,MCPSFOA is not only a highly effective and reliable optimizer for benchmark functions,but also a practical tool for solving real-world optimization problems.展开更多
Hierarchical Task Network(HTN)planning is a powerful technique in artificial intelligence for handling complex problems by decomposing them into hierarchical task structures.However,achieving optimal solutions in HTN ...Hierarchical Task Network(HTN)planning is a powerful technique in artificial intelligence for handling complex problems by decomposing them into hierarchical task structures.However,achieving optimal solutions in HTN planning remains a challenge,especially in scenarios where traditional search algorithms struggle to navigate the vast solution space efficiently.This research proposes a novel technique to enhance HTN planning by integrating the Ant Colony Optimization(ACO)algorithm into the refinement process.The Ant System algorithm,inspired by the foraging behavior of ants,is well-suited for addressing optimization problems by efficiently exploring solution spaces.By incorporating ACO into the refinement phase of HTN planning,the authors aim to leverage its adaptive nature and decentralized decision-making to improve plan generation.This paper involves the development of a hybrid strategy called ACO-HTN,which combines HTN planning with ACO-based plan selection.This technique enables the system to adaptively refine plans by guiding the search towards optimal solutions.To evaluate the effectiveness of the proposed technique,this paper conducts empirical experiments on various domains and benchmark datasets.Our results demonstrate that the ACO-HTN strategy enhances the efficiency and effectiveness of HTN planning,outperforming traditional methods in terms of solution quality and computational performance.展开更多
Wireless sensor networks(WSN)are widely used in many situations,but the disordered and random deployment mode will waste a lot of sensor resources.This paper proposes a multi-topology hierarchical collaborative partic...Wireless sensor networks(WSN)are widely used in many situations,but the disordered and random deployment mode will waste a lot of sensor resources.This paper proposes a multi-topology hierarchical collaborative particle swarm optimization(MHCHPSO)to optimize sensor deployment location and improve the coverage of WSN.MHCHPSO divides the population into three types topology:diversity topology for global exploration,fast convergence topology for local development,and collaboration topology for exploration and development.All topologies are optimized in parallel to overcome the precocious convergence of PSO.This paper compares with various heuristic algorithms at CEC 2013,CEC 2015,and CEC 2017.The experimental results show that MHCHPSO outperforms the comparison algorithms.In addition,MHCHPSO is applied to the WSN localization optimization,and the experimental results confirm the optimization ability of MHCHPSO in practical engineering problems.展开更多
Hierarchical evolutionary algorithms based on genetic algorithms (GAs) and Nash strategy of game theory are proposed to accelerate the optimization process and implemented in transonic aerodynamic shape optimization p...Hierarchical evolutionary algorithms based on genetic algorithms (GAs) and Nash strategy of game theory are proposed to accelerate the optimization process and implemented in transonic aerodynamic shape optimization problems Inspired from the natural evolution history that different periods with certain environments have different criteria for the evaluations of individuals’ fitness, a hierarchical fidelity model is introduced to reach high optimization efficiency The shape of an NACA0012 based airfoil is optimized in maximizing the lift coefficient under a given transonic flow condition Optimized results are presented and compared with the single model results and traditional GA展开更多
Based on the tropical cyclone(TC) observations in the western North Pacific from 2000 to 2008, this paper adopts the particle swarm optimization(PSO) algorithm of evolutionary computation to optimize one comprehensive...Based on the tropical cyclone(TC) observations in the western North Pacific from 2000 to 2008, this paper adopts the particle swarm optimization(PSO) algorithm of evolutionary computation to optimize one comprehensive classification rule, and apply the optimized classification rule to the forecasting of TC intensity change. In the process of the optimization, the strategy of hierarchical pruning has been adopted in the PSO algorithm to narrow the search area,and thus to enhance the local search ability, i.e. hierarchical PSO algorithm. The TC intensity classification rule involves core attributes including 12-HMWS, MPI, and Rainrate which play vital roles in TC intensity change. The testing accuracy using the new mined rule by hierarchical PSO algorithm reaches 89.6%. The current study shows that the novel classification method for TC intensity change analysis based on hierarchic PSO algorithm is not only easy to explain the source of rule core attributes, but also has great potential to improve the forecasting of TC intensity change.展开更多
Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the chall...Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.展开更多
The optimization of the rule base of a fuzzy logic system (FLS) based on evolutionary algorithm has achievednotable results. However, due to the diversity of the deep structure in the hierarchical fuzzy system (HFS) a...The optimization of the rule base of a fuzzy logic system (FLS) based on evolutionary algorithm has achievednotable results. However, due to the diversity of the deep structure in the hierarchical fuzzy system (HFS) and thecorrelation of each sub fuzzy system, the uncertainty of the HFS’s deep structure increases. For the HFS, a largenumber of studies mainly use fixed structures, which cannot be selected automatically. To solve this problem, thispaper proposes a novel approach for constructing the incremental HFS. During system design, the deep structureand the rule base of the HFS are encoded separately. Subsequently, the deep structure is adaptively mutated basedon the fitness value, so as to realize the diversity of deep structures while ensuring reasonable competition amongthe structures. Finally, the differential evolution (DE) is used to optimize the deep structure of HFS and theparameters of antecedent and consequent simultaneously. The simulation results confirm the effectiveness of themodel. Specifically, the root mean square errors in the Laser dataset and Friedman dataset are 0.0395 and 0.0725,respectively with rule counts of rules is 8 and 12, respectively.When compared to alternative methods, the resultsindicate that the proposed method offers improvements in accuracy and rule counts.展开更多
Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characte...Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characterized by high dimensionality and intricate variable relationships.The Mountain Gazelle Optimizer(MGO)is notably effective but struggles to balance local search refinement and global space exploration,often leading to premature convergence and entrapment in local optima.This paper presents the Improved MGO(IMGO),which integrates three synergistic enhancements:dynamic chaos mapping using piecewise chaotic sequences to boost explo-ration diversity;Opposition-Based Learning(OBL)with adaptive,diversity-driven activation to speed up convergence;and structural refinements to the position update mechanisms to enhance exploitation.The IMGO underwent a comprehensive evaluation using 52 standardised benchmark functions and seven engineering optimization problems.Benchmark evaluations showed that IMGO achieved the highest rank in best solution quality for 31 functions,the highest rank in mean performance for 18 functions,and the highest rank in worst-case performance for 14 functions among 11 competing algorithms.Statistical validation using Wilcoxon signed-rank tests confirmed that IMGO outperformed individual competitors across 16 to 50 functions,depending on the algorithm.At the same time,Friedman ranking analysis placed IMGO with an average rank of 4.15,compared to the baseline MGO’s 4.38,establishing the best overall performance.The evaluation of engineering problems revealed consistent improvements,including an optimal cost of 1.6896 for the welded beam design vs.MGO’s 1.7249,a minimum cost of 5885.33 for the pressure vessel design vs.MGO’s 6300,and a minimum weight of 2964.52 kg for the speed reducer design vs.MGO’s 2990.00 kg.Ablation studies identified OBL as the strongest individual contributor,whereas complete integration achieved superior performance through synergistic interactions among components.Computational complexity analysis established an O(T×N×5×f(P))time complexity,representing a 1.25×increase in fitness evaluation relative to the baseline MGO,validating the favorable accuracy-efficiency trade-offs for practical optimization applications.展开更多
Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant chal...Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.展开更多
Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when ta...Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.展开更多
Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convol...Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convolutional Neural Networks(CNN)combined with LSTM,and so on are built by simple stacking,which has the problems of feature loss,low efficiency,and low accuracy.Therefore,this paper proposes an autonomous detectionmodel for Distributed Denial of Service attacks,Multi-Scale Convolutional Neural Network-Bidirectional Gated Recurrent Units-Single Headed Attention(MSCNN-BiGRU-SHA),which is based on a Multistrategy Integrated Zebra Optimization Algorithm(MI-ZOA).The model undergoes training and testing with the CICDDoS2019 dataset,and its performance is evaluated on a new GINKS2023 dataset.The hyperparameters for Conv_filter and GRU_unit are optimized using the Multi-strategy Integrated Zebra Optimization Algorithm(MIZOA).The experimental results show that the test accuracy of the MSCNN-BiGRU-SHA model based on the MIZOA proposed in this paper is as high as 0.9971 in the CICDDoS 2019 dataset.The evaluation accuracy of the new dataset GINKS2023 created in this paper is 0.9386.Compared to the MSCNN-BiGRU-SHA model based on the Zebra Optimization Algorithm(ZOA),the detection accuracy on the GINKS2023 dataset has improved by 5.81%,precisionhas increasedby 1.35%,the recallhas improvedby 9%,and theF1scorehas increasedby 5.55%.Compared to the MSCNN-BiGRU-SHA models developed using Grid Search,Random Search,and Bayesian Optimization,the MSCNN-BiGRU-SHA model optimized with the MI-ZOA exhibits better performance in terms of accuracy,precision,recall,and F1 score.展开更多
Software defect prediction(SDP)aims to find a reliable method to predict defects in specific software projects and help software engineers allocate limited resources to release high-quality software products.Software ...Software defect prediction(SDP)aims to find a reliable method to predict defects in specific software projects and help software engineers allocate limited resources to release high-quality software products.Software defect prediction can be effectively performed using traditional features,but there are some redundant or irrelevant features in them(the presence or absence of this feature has little effect on the prediction results).These problems can be solved using feature selection.However,existing feature selection methods have shortcomings such as insignificant dimensionality reduction effect and low classification accuracy of the selected optimal feature subset.In order to reduce the impact of these shortcomings,this paper proposes a new feature selection method Cubic TraverseMa Beluga whale optimization algorithm(CTMBWO)based on the improved Beluga whale optimization algorithm(BWO).The goal of this study is to determine how well the CTMBWO can extract the features that are most important for correctly predicting software defects,improve the accuracy of fault prediction,reduce the number of the selected feature and mitigate the risk of overfitting,thereby achieving more efficient resource utilization and better distribution of test workload.The CTMBWO comprises three main stages:preprocessing the dataset,selecting relevant features,and evaluating the classification performance of the model.The novel feature selection method can effectively improve the performance of SDP.This study performs experiments on two software defect datasets(PROMISE,NASA)and shows the method’s classification performance using four detailed evaluation metrics,Accuracy,F1-score,MCC,AUC and Recall.The results indicate that the approach presented in this paper achieves outstanding classification performance on both datasets and has significant improvement over the baseline models.展开更多
Thediagnosis of Dry EyeDisease(DED),however,usually depends on clinical information and complex,high-dimensional datasets.To improve the performance of classification models,this paper proposes a Computer Aided Design...Thediagnosis of Dry EyeDisease(DED),however,usually depends on clinical information and complex,high-dimensional datasets.To improve the performance of classification models,this paper proposes a Computer Aided Design(CAD)system that presents a new method for DED classification called(IAOO-PSO),which is a powerful Feature Selection technique(FS)that integrates with Opposition-Based Learning(OBL)and Particle Swarm Optimization(PSO).We improve the speed of convergence with the PSO algorithmand the exploration with the IAOO algorithm.The IAOO is demonstrated to possess superior global optimization capabilities,as validated on the IEEE Congress on Evolutionary Computation 2022(CEC’22)benchmark suite and compared with seven Metaheuristic(MH)algorithms.Additionally,an IAOO-PSO model based on Support Vector Machines(SVMs)classifier is proposed for FS and classification,where the IAOO-PSO is used to identify the most relevant features.This model was applied to the DED dataset comprising 20,000 cases and 26 features,achieving a high classification accuracy of 99.8%,which significantly outperforms other optimization algorithms.The experimental results demonstrate the reliability,success,and efficiency of the IAOO-PSO technique for both FS and classification in the detection of DED.展开更多
Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,th...Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,this paper proposes a grid-connected/island switching control strategy for photovoltaic storage hybrid inverters based on the modified chimpanzee optimization algorithm.The proposed strategy incorporates coupling compensation and power differentiation elements based on the traditional droop control.Then,it combines the angular frequency and voltage amplitude adjustments provided by the phase-locked loop-free pre-synchronization control strategy.Precise pre-synchronization is achieved by regulating the virtual current to zero and aligning the photovoltaic storage hybrid inverter with the grid voltage.Additionally,two novel operators,learning and emotional behaviors are introduced to enhance the optimization precision of the chimpanzee algorithm.These operators ensure high-precision and high-reliability optimization of the droop control parameters for photovoltaic storage hybrid inverters.A Simulink model was constructed for simulation analysis,which validated the optimized control strategy’s ability to evenly distribute power under load transients.This strategy effectively mitigated transient voltage and current surges during mode transitions.Consequently,seamless and efficient switching between gridconnected and island modes was achieved for the photovoltaic storage hybrid inverter.The enhanced energy utilization efficiency,in turn,offers robust technical support for grid stability.展开更多
In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-base...In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.展开更多
This research presents a novel nature-inspired metaheuristic optimization algorithm,called theNarwhale Optimization Algorithm(NWOA).The algorithm draws inspiration from the foraging and prey-hunting strategies of narw...This research presents a novel nature-inspired metaheuristic optimization algorithm,called theNarwhale Optimization Algorithm(NWOA).The algorithm draws inspiration from the foraging and prey-hunting strategies of narwhals,“unicorns of the sea”,particularly the use of their distinctive spiral tusks,which play significant roles in hunting,searching prey,navigation,echolocation,and complex social interaction.Particularly,the NWOA imitates the foraging strategies and techniques of narwhals when hunting for prey but focuses mainly on the cooperative and exploratory behavior shown during group hunting and in the use of their tusks in sensing and locating prey under the Arctic ice.These functions provide a strong assessment basis for investigating the algorithm’s prowess at balancing exploration and exploitation,convergence speed,and solution accuracy.The performance of the NWOA is evaluated on 30 benchmark test functions.A comparison study using the Grey Wolf Optimizer(GWO),Whale Optimization Algorithm(WOA),Perfumer Optimization Algorithm(POA),Candle Flame Optimization(CFO)Algorithm,Particle Swarm Optimization(PSO)Algorithm,and Genetic Algorithm(GA)validates the results.As evidenced in the experimental results,NWOA is capable of yielding competitive outcomes among these well-known optimizers,whereas in several instances.These results suggest thatNWOAhas proven to be an effective and robust optimization tool suitable for solving many different complex optimization problems from the real world.展开更多
Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple dat...Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.展开更多
This paper addresses the shortcomings of the Sparrow and Eagle Optimization Algorithm (SBOA) in terms of convergence accuracy, convergence speed, and susceptibility to local optima. To this end, an improved Sparrow an...This paper addresses the shortcomings of the Sparrow and Eagle Optimization Algorithm (SBOA) in terms of convergence accuracy, convergence speed, and susceptibility to local optima. To this end, an improved Sparrow and Eagle Optimization Algorithm (HS-SBOA) is proposed. Initially, the algorithm employs Iterative Mapping to generate an initial sparrow and eagle population, enhancing the diversity of the population during the global search phase. Subsequently, an adaptive weighting strategy is introduced during the exploration phase of the algorithm to achieve a balance between exploration and exploitation. Finally, to avoid the algorithm falling into local optima, a Cauchy mutation operation is applied to the current best individual. To validate the performance of the HS-SBOA algorithm, it was applied to the CEC2021 benchmark function set and three practical engineering problems, and compared with other optimization algorithms such as the Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA) to test the effectiveness of the improved algorithm. The simulation experimental results show that the HS-SBOA algorithm demonstrates significant advantages in terms of convergence speed and accuracy, thereby validating the effectiveness of its improved strategies.展开更多
文摘Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.
文摘Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises structural weight under stress and frequency constraints.Two new algorithms,the Red Kite Optimization Algorithm(ROA)and Secretary Bird Optimization Algorithm(SBOA),are utilized on five benchmark trusses with 10,18,37,72,and 200-bar trusses.Both algorithms are evaluated against benchmarks in the literature.The results indicate that SBOA always reaches a lighter optimal.Designs with reducing structural weight ranging from 0.02%to 0.15%compared to ROA,and up to 6%–8%as compared to conventional algorithms.In addition,SBOA can achieve 15%–20%faster convergence speed and 10%–18%reduction in computational time with a smaller standard deviation over independent runs,which demonstrates its robustness and reliability.It is indicated that the adaptive exploration mechanism of SBOA,especially its Levy flight–based search strategy,can obviously improve optimization performance for low-and high-dimensional trusses.The research has implications in the context of promoting bio-inspired optimization techniques by demonstrating the viability of SBOA,a reliable model for large-scale structural design that provides significant enhancements in performance and convergence behavior.
基金supported by the National Natural Science Foundation of China(Grant No.12402139,No.52368070)supported by Hainan Provincial Natural Science Foundation of China(Grant No.524QN223)+3 种基金Scientific Research Startup Foundation of Hainan University(Grant No.RZ2300002710)State Key Laboratory of Structural Analysis,Optimization and CAE Software for Industrial Equipment,Dalian University of Technology(Grant No.GZ24107)the Horizontal Research Project(Grant No.HD-KYH-2024022)Innovative Research Projects for Postgraduate Students in Hainan Province(Grant No.Hys2025-217).
文摘Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(SFOA)is a recently optimizer inspired by swarm intelligence,which is effective for numerical optimization,but it may encounter premature and local convergence for complex optimization problems.To address these challenges,this paper proposes the multi-strategy enhanced crested porcupine-starfish optimization algorithm(MCPSFOA).The core innovation of MCPSFOA lies in employing a hybrid strategy to improve SFOA,which integrates the exploratory mechanisms of SFOA with the diverse search capacity of the Crested Porcupine Optimizer(CPO).This synergy enhances MCPSFOA’s ability to navigate complex and multimodal search spaces.To further prevent premature convergence,MCPSFOA incorporates Lévy flight,leveraging its characteristic long and short jump patterns to enable large-scale exploration and escape from local optima.Subsequently,Gaussian mutation is applied for precise solution tuning,introducing controlled perturbations that enhance accuracy and mitigate the risk of insufficient exploitation.Notably,the population diversity enhancement mechanism periodically identifies and resets stagnant individuals,thereby consistently revitalizing population variety throughout the optimization process.MCPSFOA is rigorously evaluated on 24 classical benchmark functions(including high-dimensional cases),the CEC2017 suite,and the CEC2022 suite.MCPSFOA achieves superior overall performance with Friedman mean ranks of 2.208,2.310 and 2.417 on these benchmark functions,outperforming 11 state-of-the-art algorithms.Furthermore,the practical applicability of MCPSFOA is confirmed through its successful application to five engineering optimization cases,where it also yields excellent results.In conclusion,MCPSFOA is not only a highly effective and reliable optimizer for benchmark functions,but also a practical tool for solving real-world optimization problems.
基金supported by the Ministry of Science and High Education of the Russian Federation by the grant 075-15-2022-1137supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2025R323),Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘Hierarchical Task Network(HTN)planning is a powerful technique in artificial intelligence for handling complex problems by decomposing them into hierarchical task structures.However,achieving optimal solutions in HTN planning remains a challenge,especially in scenarios where traditional search algorithms struggle to navigate the vast solution space efficiently.This research proposes a novel technique to enhance HTN planning by integrating the Ant Colony Optimization(ACO)algorithm into the refinement process.The Ant System algorithm,inspired by the foraging behavior of ants,is well-suited for addressing optimization problems by efficiently exploring solution spaces.By incorporating ACO into the refinement phase of HTN planning,the authors aim to leverage its adaptive nature and decentralized decision-making to improve plan generation.This paper involves the development of a hybrid strategy called ACO-HTN,which combines HTN planning with ACO-based plan selection.This technique enables the system to adaptively refine plans by guiding the search towards optimal solutions.To evaluate the effectiveness of the proposed technique,this paper conducts empirical experiments on various domains and benchmark datasets.Our results demonstrate that the ACO-HTN strategy enhances the efficiency and effectiveness of HTN planning,outperforming traditional methods in terms of solution quality and computational performance.
基金supported by the National Key Research and Development Program Projects of China(No.2018YFC1504705)the National Natural Science Foundation of China(No.61731015)+1 种基金the Major instrument special project of National Natural Science Foundation of China(No.42027806)the Key Research and Development Program of Shaanxi(No.2022GY-331)。
文摘Wireless sensor networks(WSN)are widely used in many situations,but the disordered and random deployment mode will waste a lot of sensor resources.This paper proposes a multi-topology hierarchical collaborative particle swarm optimization(MHCHPSO)to optimize sensor deployment location and improve the coverage of WSN.MHCHPSO divides the population into three types topology:diversity topology for global exploration,fast convergence topology for local development,and collaboration topology for exploration and development.All topologies are optimized in parallel to overcome the precocious convergence of PSO.This paper compares with various heuristic algorithms at CEC 2013,CEC 2015,and CEC 2017.The experimental results show that MHCHPSO outperforms the comparison algorithms.In addition,MHCHPSO is applied to the WSN localization optimization,and the experimental results confirm the optimization ability of MHCHPSO in practical engineering problems.
基金Start-up foundation item of the Educational Department of China for returnees
文摘Hierarchical evolutionary algorithms based on genetic algorithms (GAs) and Nash strategy of game theory are proposed to accelerate the optimization process and implemented in transonic aerodynamic shape optimization problems Inspired from the natural evolution history that different periods with certain environments have different criteria for the evaluations of individuals’ fitness, a hierarchical fidelity model is introduced to reach high optimization efficiency The shape of an NACA0012 based airfoil is optimized in maximizing the lift coefficient under a given transonic flow condition Optimized results are presented and compared with the single model results and traditional GA
基金National Natural Science Foundation of China(41201045)Jiangsu Qing Lan Project(2016)Natural Science Foundation of Jiangsu Province(BK20151458)
文摘Based on the tropical cyclone(TC) observations in the western North Pacific from 2000 to 2008, this paper adopts the particle swarm optimization(PSO) algorithm of evolutionary computation to optimize one comprehensive classification rule, and apply the optimized classification rule to the forecasting of TC intensity change. In the process of the optimization, the strategy of hierarchical pruning has been adopted in the PSO algorithm to narrow the search area,and thus to enhance the local search ability, i.e. hierarchical PSO algorithm. The TC intensity classification rule involves core attributes including 12-HMWS, MPI, and Rainrate which play vital roles in TC intensity change. The testing accuracy using the new mined rule by hierarchical PSO algorithm reaches 89.6%. The current study shows that the novel classification method for TC intensity change analysis based on hierarchic PSO algorithm is not only easy to explain the source of rule core attributes, but also has great potential to improve the forecasting of TC intensity change.
基金jointly supported by the Jiangsu Postgraduate Research and Practice Innovation Project under Grant KYCX22_1030,SJCX22_0283 and SJCX23_0293the NUPTSF under Grant NY220201.
文摘Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.
基金the Sichuan Science and Technology Program(2021ZYD0016).
文摘The optimization of the rule base of a fuzzy logic system (FLS) based on evolutionary algorithm has achievednotable results. However, due to the diversity of the deep structure in the hierarchical fuzzy system (HFS) and thecorrelation of each sub fuzzy system, the uncertainty of the HFS’s deep structure increases. For the HFS, a largenumber of studies mainly use fixed structures, which cannot be selected automatically. To solve this problem, thispaper proposes a novel approach for constructing the incremental HFS. During system design, the deep structureand the rule base of the HFS are encoded separately. Subsequently, the deep structure is adaptively mutated basedon the fitness value, so as to realize the diversity of deep structures while ensuring reasonable competition amongthe structures. Finally, the differential evolution (DE) is used to optimize the deep structure of HFS and theparameters of antecedent and consequent simultaneously. The simulation results confirm the effectiveness of themodel. Specifically, the root mean square errors in the Laser dataset and Friedman dataset are 0.0395 and 0.0725,respectively with rule counts of rules is 8 and 12, respectively.When compared to alternative methods, the resultsindicate that the proposed method offers improvements in accuracy and rule counts.
文摘Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characterized by high dimensionality and intricate variable relationships.The Mountain Gazelle Optimizer(MGO)is notably effective but struggles to balance local search refinement and global space exploration,often leading to premature convergence and entrapment in local optima.This paper presents the Improved MGO(IMGO),which integrates three synergistic enhancements:dynamic chaos mapping using piecewise chaotic sequences to boost explo-ration diversity;Opposition-Based Learning(OBL)with adaptive,diversity-driven activation to speed up convergence;and structural refinements to the position update mechanisms to enhance exploitation.The IMGO underwent a comprehensive evaluation using 52 standardised benchmark functions and seven engineering optimization problems.Benchmark evaluations showed that IMGO achieved the highest rank in best solution quality for 31 functions,the highest rank in mean performance for 18 functions,and the highest rank in worst-case performance for 14 functions among 11 competing algorithms.Statistical validation using Wilcoxon signed-rank tests confirmed that IMGO outperformed individual competitors across 16 to 50 functions,depending on the algorithm.At the same time,Friedman ranking analysis placed IMGO with an average rank of 4.15,compared to the baseline MGO’s 4.38,establishing the best overall performance.The evaluation of engineering problems revealed consistent improvements,including an optimal cost of 1.6896 for the welded beam design vs.MGO’s 1.7249,a minimum cost of 5885.33 for the pressure vessel design vs.MGO’s 6300,and a minimum weight of 2964.52 kg for the speed reducer design vs.MGO’s 2990.00 kg.Ablation studies identified OBL as the strongest individual contributor,whereas complete integration achieved superior performance through synergistic interactions among components.Computational complexity analysis established an O(T×N×5×f(P))time complexity,representing a 1.25×increase in fitness evaluation relative to the baseline MGO,validating the favorable accuracy-efficiency trade-offs for practical optimization applications.
文摘Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.
基金funded by National Natural Science Foundation of China(Nos.12402142,11832013 and 11572134)Natural Science Foundation of Hubei Province(No.2024AFB235)+1 种基金Hubei Provincial Department of Education Science and Technology Research Project(No.Q20221714)the Opening Foundation of Hubei Key Laboratory of Digital Textile Equipment(Nos.DTL2023019 and DTL2022012).
文摘Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.
基金supported by Science and Technology Innovation Programfor Postgraduate Students in IDP Subsidized by Fundamental Research Funds for the Central Universities(Project No.ZY20240335)support of the Research Project of the Key Technology of Malicious Code Detection Based on Data Mining in APT Attack(Project No.2022IT173)the Research Project of the Big Data Sensitive Information Supervision Technology Based on Convolutional Neural Network(Project No.2022011033).
文摘Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convolutional Neural Networks(CNN)combined with LSTM,and so on are built by simple stacking,which has the problems of feature loss,low efficiency,and low accuracy.Therefore,this paper proposes an autonomous detectionmodel for Distributed Denial of Service attacks,Multi-Scale Convolutional Neural Network-Bidirectional Gated Recurrent Units-Single Headed Attention(MSCNN-BiGRU-SHA),which is based on a Multistrategy Integrated Zebra Optimization Algorithm(MI-ZOA).The model undergoes training and testing with the CICDDoS2019 dataset,and its performance is evaluated on a new GINKS2023 dataset.The hyperparameters for Conv_filter and GRU_unit are optimized using the Multi-strategy Integrated Zebra Optimization Algorithm(MIZOA).The experimental results show that the test accuracy of the MSCNN-BiGRU-SHA model based on the MIZOA proposed in this paper is as high as 0.9971 in the CICDDoS 2019 dataset.The evaluation accuracy of the new dataset GINKS2023 created in this paper is 0.9386.Compared to the MSCNN-BiGRU-SHA model based on the Zebra Optimization Algorithm(ZOA),the detection accuracy on the GINKS2023 dataset has improved by 5.81%,precisionhas increasedby 1.35%,the recallhas improvedby 9%,and theF1scorehas increasedby 5.55%.Compared to the MSCNN-BiGRU-SHA models developed using Grid Search,Random Search,and Bayesian Optimization,the MSCNN-BiGRU-SHA model optimized with the MI-ZOA exhibits better performance in terms of accuracy,precision,recall,and F1 score.
文摘Software defect prediction(SDP)aims to find a reliable method to predict defects in specific software projects and help software engineers allocate limited resources to release high-quality software products.Software defect prediction can be effectively performed using traditional features,but there are some redundant or irrelevant features in them(the presence or absence of this feature has little effect on the prediction results).These problems can be solved using feature selection.However,existing feature selection methods have shortcomings such as insignificant dimensionality reduction effect and low classification accuracy of the selected optimal feature subset.In order to reduce the impact of these shortcomings,this paper proposes a new feature selection method Cubic TraverseMa Beluga whale optimization algorithm(CTMBWO)based on the improved Beluga whale optimization algorithm(BWO).The goal of this study is to determine how well the CTMBWO can extract the features that are most important for correctly predicting software defects,improve the accuracy of fault prediction,reduce the number of the selected feature and mitigate the risk of overfitting,thereby achieving more efficient resource utilization and better distribution of test workload.The CTMBWO comprises three main stages:preprocessing the dataset,selecting relevant features,and evaluating the classification performance of the model.The novel feature selection method can effectively improve the performance of SDP.This study performs experiments on two software defect datasets(PROMISE,NASA)and shows the method’s classification performance using four detailed evaluation metrics,Accuracy,F1-score,MCC,AUC and Recall.The results indicate that the approach presented in this paper achieves outstanding classification performance on both datasets and has significant improvement over the baseline models.
文摘Thediagnosis of Dry EyeDisease(DED),however,usually depends on clinical information and complex,high-dimensional datasets.To improve the performance of classification models,this paper proposes a Computer Aided Design(CAD)system that presents a new method for DED classification called(IAOO-PSO),which is a powerful Feature Selection technique(FS)that integrates with Opposition-Based Learning(OBL)and Particle Swarm Optimization(PSO).We improve the speed of convergence with the PSO algorithmand the exploration with the IAOO algorithm.The IAOO is demonstrated to possess superior global optimization capabilities,as validated on the IEEE Congress on Evolutionary Computation 2022(CEC’22)benchmark suite and compared with seven Metaheuristic(MH)algorithms.Additionally,an IAOO-PSO model based on Support Vector Machines(SVMs)classifier is proposed for FS and classification,where the IAOO-PSO is used to identify the most relevant features.This model was applied to the DED dataset comprising 20,000 cases and 26 features,achieving a high classification accuracy of 99.8%,which significantly outperforms other optimization algorithms.The experimental results demonstrate the reliability,success,and efficiency of the IAOO-PSO technique for both FS and classification in the detection of DED.
基金received funding from the Postgraduate Research&Practice Innovation Program of Jiangsu Province(SJCX23_1633)2023 University Student Innovation and Entrepreneurship Training Program(202311463009Z)+1 种基金Changzhou Science and Technology Support Project(CE20235045)Open Project of Jiangsu Key Laboratory of Power Transmission&Distribution Equipment Technology(2021JSSPD12).
文摘Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,this paper proposes a grid-connected/island switching control strategy for photovoltaic storage hybrid inverters based on the modified chimpanzee optimization algorithm.The proposed strategy incorporates coupling compensation and power differentiation elements based on the traditional droop control.Then,it combines the angular frequency and voltage amplitude adjustments provided by the phase-locked loop-free pre-synchronization control strategy.Precise pre-synchronization is achieved by regulating the virtual current to zero and aligning the photovoltaic storage hybrid inverter with the grid voltage.Additionally,two novel operators,learning and emotional behaviors are introduced to enhance the optimization precision of the chimpanzee algorithm.These operators ensure high-precision and high-reliability optimization of the droop control parameters for photovoltaic storage hybrid inverters.A Simulink model was constructed for simulation analysis,which validated the optimized control strategy’s ability to evenly distribute power under load transients.This strategy effectively mitigated transient voltage and current surges during mode transitions.Consequently,seamless and efficient switching between gridconnected and island modes was achieved for the photovoltaic storage hybrid inverter.The enhanced energy utilization efficiency,in turn,offers robust technical support for grid stability.
基金Shanxi Province Higher Education Science and Technology Innovation Fund Project(2022-676)Shanxi Soft Science Program Research Fund Project(2016041008-6)。
文摘In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.
文摘This research presents a novel nature-inspired metaheuristic optimization algorithm,called theNarwhale Optimization Algorithm(NWOA).The algorithm draws inspiration from the foraging and prey-hunting strategies of narwhals,“unicorns of the sea”,particularly the use of their distinctive spiral tusks,which play significant roles in hunting,searching prey,navigation,echolocation,and complex social interaction.Particularly,the NWOA imitates the foraging strategies and techniques of narwhals when hunting for prey but focuses mainly on the cooperative and exploratory behavior shown during group hunting and in the use of their tusks in sensing and locating prey under the Arctic ice.These functions provide a strong assessment basis for investigating the algorithm’s prowess at balancing exploration and exploitation,convergence speed,and solution accuracy.The performance of the NWOA is evaluated on 30 benchmark test functions.A comparison study using the Grey Wolf Optimizer(GWO),Whale Optimization Algorithm(WOA),Perfumer Optimization Algorithm(POA),Candle Flame Optimization(CFO)Algorithm,Particle Swarm Optimization(PSO)Algorithm,and Genetic Algorithm(GA)validates the results.As evidenced in the experimental results,NWOA is capable of yielding competitive outcomes among these well-known optimizers,whereas in several instances.These results suggest thatNWOAhas proven to be an effective and robust optimization tool suitable for solving many different complex optimization problems from the real world.
文摘Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.
文摘This paper addresses the shortcomings of the Sparrow and Eagle Optimization Algorithm (SBOA) in terms of convergence accuracy, convergence speed, and susceptibility to local optima. To this end, an improved Sparrow and Eagle Optimization Algorithm (HS-SBOA) is proposed. Initially, the algorithm employs Iterative Mapping to generate an initial sparrow and eagle population, enhancing the diversity of the population during the global search phase. Subsequently, an adaptive weighting strategy is introduced during the exploration phase of the algorithm to achieve a balance between exploration and exploitation. Finally, to avoid the algorithm falling into local optima, a Cauchy mutation operation is applied to the current best individual. To validate the performance of the HS-SBOA algorithm, it was applied to the CEC2021 benchmark function set and three practical engineering problems, and compared with other optimization algorithms such as the Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA) to test the effectiveness of the improved algorithm. The simulation experimental results show that the HS-SBOA algorithm demonstrates significant advantages in terms of convergence speed and accuracy, thereby validating the effectiveness of its improved strategies.
