Heuristic optimization algorithms have been widely used in solving complex optimization problems in various fields such as engineering,economics,and computer science.These algorithms are designed to find high-quality ...Heuristic optimization algorithms have been widely used in solving complex optimization problems in various fields such as engineering,economics,and computer science.These algorithms are designed to find high-quality solutions efficiently by balancing exploration of the search space and exploitation of promising solutions.While heuristic optimization algorithms vary in their specific details,they often exhibit common patterns that are essential to their effectiveness.This paper aims to analyze and explore common patterns in heuristic optimization algorithms.Through a comprehensive review of the literature,we identify the patterns that are commonly observed in these algorithms,including initialization,local search,diversity maintenance,adaptation,and stochasticity.For each pattern,we describe the motivation behind it,its implementation,and its impact on the search process.To demonstrate the utility of our analysis,we identify these patterns in multiple heuristic optimization algorithms.For each case study,we analyze how the patterns are implemented in the algorithm and how they contribute to its performance.Through these case studies,we show how our analysis can be used to understand the behavior of heuristic optimization algorithms and guide the design of new algorithms.Our analysis reveals that patterns in heuristic optimization algorithms are essential to their effectiveness.By understanding and incorporating these patterns into the design of new algorithms,researchers can develop more efficient and effective optimization algorithms.展开更多
The optimization of reaction processes is crucial for the green, efficient, and sustainable development of the chemical industry. However, how to address the problems posed by multiple variables, nonlinearities, and u...The optimization of reaction processes is crucial for the green, efficient, and sustainable development of the chemical industry. However, how to address the problems posed by multiple variables, nonlinearities, and uncertainties during optimization remains a formidable challenge. In this study, a strategy combining interpretable machine learning with metaheuristic optimization algorithms is employed to optimize the reaction process. First, experimental data from a biodiesel production process are collected to establish a database. These data are then used to construct a predictive model based on artificial neural network (ANN) models. Subsequently, interpretable machine learning techniques are applied for quantitative analysis and verification of the model. Finally, four metaheuristic optimization algorithms are coupled with the ANN model to achieve the desired optimization. The research results show that the methanol: palm fatty acid distillate (PFAD) molar ratio contributes the most to the reaction outcome, accounting for 41%. The ANN-simulated annealing (SA) hybrid method is more suitable for this optimization, and the optimal process parameters are a catalyst concentration of 3.00% (mass), a methanol: PFAD molar ratio of 8.67, and a reaction time of 30 min. This study provides deeper insights into reaction process optimization, which will facilitate future applications in various reaction optimization processes.展开更多
Storm identification and tracking based on weather radar data are essential to nowcasting and severe weather warning. A new two-dimensional storm identification method simultaneously seeking in two directions is propo...Storm identification and tracking based on weather radar data are essential to nowcasting and severe weather warning. A new two-dimensional storm identification method simultaneously seeking in two directions is proposed, and identification results are used to discuss storm tracking algorithms. Three modern optimization algorithms （simulated annealing algorithm, genetic algorithm and ant colony algorithm） are tested to match storms in successive time intervals. Preliminary results indicate that the simulated annealing algorithm and ant colony algorithm are effective and have intuitionally adjustable parameters, whereas the genetic algorithm is unsatisfaetorily constrained by the mode of genetic operations Experiments provide not only the feasibility and characteristics of storm tracking with modern optimization algorithms, but also references for studies and applications in relevant fields.展开更多
Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as ...Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as industry,automotive,construction,machinery,and interdisciplinary research.However,there are established optimization techniques that have shown effectiveness in addressing these types of issues.This research paper gives a comparative study of the implementation of seventeen new metaheuristic methods in order to optimize twelve distinct engineering design issues.The algorithms used in the study are listed as:transient search optimization(TSO),equilibrium optimizer(EO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),slimemould algorithm(SMA),harris hawks optimization(HHO),chimp optimization algorithm(COA),coot optimization algorithm(COOT),multi-verse optimization(MVO),arithmetic optimization algorithm(AOA),aquila optimizer(AO),sine cosine algorithm(SCA),smell agent optimization(SAO),and seagull optimization algorithm(SOA),pelican optimization algorithm(POA),and coati optimization algorithm(CA).As far as we know,there is no comparative analysis of recent and popular methods against the concrete conditions of real-world engineering problems.Hence,a remarkable research guideline is presented in the study for researchersworking in the fields of engineering and artificial intelligence,especiallywhen applying the optimization methods that have emerged recently.Future research can rely on this work for a literature search on comparisons of metaheuristic optimization methods in real-world problems under similar conditions.展开更多
Statistical distributions are used to model wind speed,and the twoparameters Weibull distribution has proven its effectiveness at characterizing wind speed.Accurate estimation of Weibull parameters,the scale(c)and sha...Statistical distributions are used to model wind speed,and the twoparameters Weibull distribution has proven its effectiveness at characterizing wind speed.Accurate estimation of Weibull parameters,the scale(c)and shape(k),is crucial in describing the actual wind speed data and evaluating the wind energy potential.Therefore,this study compares the most common conventional numerical(CN)estimation methods and the recent intelligent optimization algorithms(IOA)to show how precise estimation of c and k affects the wind energy resource assessments.In addition,this study conducts technical and economic feasibility studies for five sites in the northern part of Saudi Arabia,namely Aljouf,Rafha,Tabuk,Turaif,and Yanbo.Results exhibit that IOAs have better performance in attaining optimal Weibull parameters and provided an adequate description of the observed wind speed data.Also,with six wind turbine technologies rating between 1 and 3MW,the technical and economic assessment results reveal that the CN methods tend to overestimate the energy output and underestimate the cost of energy($/kWh)compared to the assessments by IOAs.The energy cost analyses show that Turaif is the windiest site,with an electricity cost of$0.016906/kWh.The highest wind energy output is obtained with the wind turbine having a rated power of 2.5 MW at all considered sites with electricity costs not exceeding$0.02739/kWh.Finally,the outcomes of this study exhibit the potential of wind energy in Saudi Arabia,and its environmental goals can be acquired by harvesting wind energy.展开更多
This paper systematically evaluates and compares three well-engineered and popular multi-objective optimization algorithms for the design of switched reluctance machines.The multi-physics and multi-objective nature of...This paper systematically evaluates and compares three well-engineered and popular multi-objective optimization algorithms for the design of switched reluctance machines.The multi-physics and multi-objective nature of electric machine design problems are discussed,followed by benchmark studies comparing generic algorithms(GA),differential evolution(DE)algorithms and particle swarm optimizations(PSO)on a 6/4 switched reluctance machine design with seven independent variables and a strong nonlinear multi-objective Pareto front.To better quantify the quality of the Pareto fronts,five primary quality indicators are employed to serve as the algorithm testing metrics.The results show that the three algorithms have similar performances when the optimization employs only a small number of candidate designs or ultimately,a significant amount of candidate designs.However,DE tends to perform better in terms of convergence speed and the quality of Pareto front when a relatively modest amount of candidates are considered.展开更多
To protect trains against strong cross-wind along Qinghai-Tibet railway, a strong wind speed monitoring and warning system was developed. And to obtain high-precision wind speed short-term forecasting values for the s...To protect trains against strong cross-wind along Qinghai-Tibet railway, a strong wind speed monitoring and warning system was developed. And to obtain high-precision wind speed short-term forecasting values for the system to make more accurate scheduling decision, two optimization algorithms were proposed. Using them to make calculative examples for actual wind speed time series from the 18th meteorological station, the results show that: the optimization algorithm based on wavelet analysis method and improved time series analysis method can attain high-precision multi-step forecasting values, the mean relative errors of one-step, three-step, five-step and ten-step forecasting are only 0.30%, 0.75%, 1.15% and 1.65%, respectively. The optimization algorithm based on wavelet analysis method and Kalman time series analysis method can obtain high-precision one-step forecasting values, the mean relative error of one-step forecasting is reduced by 61.67% to 0.115%. The two optimization algorithms both maintain the modeling simple character, and can attain prediction explicit equations after modeling calculation.展开更多
The vehicle routing problem(VRP)is a typical discrete combinatorial optimization problem,and many models and algorithms have been proposed to solve the VRP and its variants.Although existing approaches have contribute...The vehicle routing problem(VRP)is a typical discrete combinatorial optimization problem,and many models and algorithms have been proposed to solve the VRP and its variants.Although existing approaches have contributed significantly to the development of this field,these approaches either are limited in problem size or need manual intervention in choosing parameters.To solve these difficulties,many studies have considered learning-based optimization(LBO)algorithms to solve the VRP.This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches.We performed a statistical analysis of the reviewed articles from various aspects and designed three experiments to evaluate the performance of four representative LBO algorithms.Finally,we conclude the applicable types of problems for different LBO algorithms and suggest directions in which researchers can improve LBO algorithms.展开更多
In this paper, we develop a new theoretical framework by means of the absorbing Markov process theory for analyzing some stochastic global optimization algorithms. Applying the framework to the pure random search, we ...In this paper, we develop a new theoretical framework by means of the absorbing Markov process theory for analyzing some stochastic global optimization algorithms. Applying the framework to the pure random search, we prove that the pure random search converges to the global minimum in probability and its time has geometry distribution. We also analyze the pure adaptive search by this framework and turn out that the pure adaptive search converges to the global minimum in probability and its time has Poisson distribution.展开更多
Based on the trajectory design of a mission to Saturn, this paper discusses four different trajectories in various swingby cases. We assume a single impulse to be applied in each case when the spacecraft approaches a ...Based on the trajectory design of a mission to Saturn, this paper discusses four different trajectories in various swingby cases. We assume a single impulse to be applied in each case when the spacecraft approaches a celestial body. Some optimal trajectories ofEJS, EMS, EVEJS and EVVEJS flying sequences are obtained using five global optimization algorithms： DE, PSO, DP, the hybrid algorithm PSODE and another hybrid algorithm, DPDE. DE is proved to be supe- rior to other non-hybrid algorithms in the trajectory optimi- zation problem. The hybrid algorithm of PSO and DE can improve the optimization performance of DE, which is vali- dated by the mission to Saturn with given swingby sequences. Finally, the optimization results of four different swingby sequences are compared with those of the ACT of ESA.展开更多
Traditional laboratory tests for measuring rock uniaxial compressive strength(UCS)are tedious and timeconsuming.There is a pressing need for more effective methods to determine rock UCS,especially in deep mining envir...Traditional laboratory tests for measuring rock uniaxial compressive strength(UCS)are tedious and timeconsuming.There is a pressing need for more effective methods to determine rock UCS,especially in deep mining environments under high in-situ stress.Thus,this study aims to develop an advanced model for predicting the UCS of rockmaterial in deepmining environments by combining three boosting-basedmachine learning methods with four optimization algorithms.For this purpose,the Lead-Zinc mine in Southwest China is considered as the case study.Rock density,P-wave velocity,and point load strength index are used as input variables,and UCS is regarded as the output.Subsequently,twelve hybrid predictive models are obtained.Root mean square error(RMSE),mean absolute error(MAE),coefficient of determination(R2),and the proportion of the mean absolute percentage error less than 20%(A-20)are selected as the evaluation metrics.Experimental results showed that the hybridmodel consisting of the extreme gradient boostingmethod and the artificial bee colony algorithm(XGBoost-ABC)achieved satisfactory results on the training dataset and exhibited the best generalization performance on the testing dataset.The values of R2,A-20,RMSE,and MAE on the training dataset are 0.98,1.0,3.11 MPa,and 2.23MPa,respectively.The highest values of R2 and A-20(0.93 and 0.96),and the smallest RMSE and MAE values of 4.78 MPa and 3.76MPa,are observed on the testing dataset.The proposed hybrid model can be considered a reliable and effective method for predicting rock UCS in deep mines.展开更多
A multi-strategy hybrid whale optimization algorithm(MSHWOA)for complex constrained optimization problems is proposed to overcome the drawbacks of easily trapping into local optimum,slow convergence speed and low opti...A multi-strategy hybrid whale optimization algorithm(MSHWOA)for complex constrained optimization problems is proposed to overcome the drawbacks of easily trapping into local optimum,slow convergence speed and low optimization precision.Firstly,the population is initialized by introducing the theory of good point set,which increases the randomness and diversity of the population and lays the foundation for the global optimization of the algorithm.Then,a novel linearly update equation of convergence factor is designed to coordinate the abilities of exploration and exploitation.At the same time,the global exploration and local exploitation capabilities are improved through the siege mechanism of Harris Hawks optimization algorithm.Finally,the simulation experiments are conducted on the 6 benchmark functions and Wilcoxon rank sum test to evaluate the optimization performance of the improved algorithm.The experimental results show that the proposed algorithm has more significant improvement in optimization accuracy,convergence speed and robustness than the comparison algorithm.展开更多
In this paper, we consider the distributed optimization problem, where the goal is to minimize the global objective function formed by a sum of agents' local smooth and strongly convex objective functions, over un...In this paper, we consider the distributed optimization problem, where the goal is to minimize the global objective function formed by a sum of agents' local smooth and strongly convex objective functions, over undirected connected graphs. Several distributed accelerated algorithms have been proposed for solving such a problem in the existing literature. In this paper, we provide insights for understanding these existing distributed algorithms from an ordinary differential equation(ODE) point of view. More specifically, we first derive an equivalent second-order ODE, which is the exact limit of these existing algorithms by taking the small step-size. Moreover, focusing on the quadratic objective functions, we show that the solution of the resulting ODE exponentially converges to the unique global optimal solution. The theoretical results are validated and illustrated by numerical simulations.展开更多
Nonlinear Equations(NEs),which may usually have multiple roots,are ubiquitous in diverse fields.One of the main purposes of solving NEs is to locate as many roots as possible simultaneously in a single run,however,it ...Nonlinear Equations(NEs),which may usually have multiple roots,are ubiquitous in diverse fields.One of the main purposes of solving NEs is to locate as many roots as possible simultaneously in a single run,however,it is a difficult and challenging task in numerical computation.In recent years,Intelligent Optimization Algorithms(IOAs)have shown to be particularly effective in solving NEs.This paper provides a comprehensive survey on IOAs that have been exploited to locate multiple roots of NEs.This paper first revisits the fundamental definition of NEs and reviews the most recent development of the transformation techniques.Then,solving NEs with IOAs is reviewed,followed by the benchmark functions and the performance comparison of several state-of-the-art algorithms.Finally,this paper points out the challenges and some possible open issues for solving NEs.展开更多
The utilization of recycled aggregates(RA)for concrete production has the potential to offer substantial environmental and economic advantages.However,RA concrete is plagued with considerable durability concerns,parti...The utilization of recycled aggregates(RA)for concrete production has the potential to offer substantial environmental and economic advantages.However,RA concrete is plagued with considerable durability concerns,particularly carbonation.To advance the application of RA concrete,the establishment of a reliable model for predicting the carbonation is needed.On the one hand,concrete carbonation is a long and slow process and thus consumes a lot of time and energy to monitor.On the other hand,carbonation is influenced by many factors and is hard to predict.Regarding this,this paper proposes the use of machine learning techniques to establish accurate prediction models for the carbonation depth(CD)of RA concrete.Three types of regression techniques and meta-heuristic algorithms were employed to provide more alternative predictive tools.It was found that the best prediction performance was obtained from extreme gradient boosting-multi-universe optimizer(XGB-MVO)with R^(2) value of 0.9949 and 0.9398 for training and testing sets,respectively.XGB-MVO was used for evaluating physical laws of carbonation and it was found that the developed XGB-MVO model could provide reasonable predictions when new data were investigated.It also showed better generalization capabilities when compared with different models in the literature.Overall,this paper emphasizes the need for sustainable solutions in the construction industry to reduce its environmental impact and contribute to sustainable and low-carbon economies.展开更多
Shear failure of slender reinforced concrete beams without stirrups has surely been a complicated occurrence that has proven challenging to adequately understand.The primary purpose of this work is to develop machine ...Shear failure of slender reinforced concrete beams without stirrups has surely been a complicated occurrence that has proven challenging to adequately understand.The primary purpose of this work is to develop machine learning models capable of reliably predicting the shear strength of non-shear-reinforced slender beams(SB).A database encompassing 1118 experimental findings from the relevant literature was compiled,containing eight distinct factors.Gradient Boosting(GB)technique was developed and evaluated in combination with three different optimization algorithms,namely Particle Swarm Optimization(PSO),Random Annealing Optimization(RA),and Simulated Annealing Optimization(SA).The findings suggested that GB-SA could deliver strong prediction results and effectively generalizes the connection between the input and output variables.Shap values and two-dimensional PDP analysis were then carried out.Engineers may use the findings in this work to define beam’s geometrical components and material used to achieve the desired shear strength of SB without reinforcement.展开更多
Particle Swarm Optimization(PSO)has been utilized as a useful tool for solving intricate optimization problems for various applications in different fields.This paper attempts to carry out an update on PSO and gives a...Particle Swarm Optimization(PSO)has been utilized as a useful tool for solving intricate optimization problems for various applications in different fields.This paper attempts to carry out an update on PSO and gives a review of its recent developments and applications,but also provides arguments for its efficacy in resolving optimization problems in comparison with other algorithms.Covering six strategic areas,which include Data Mining,Machine Learning,Engineering Design,Energy Systems,Healthcare,and Robotics,the study demonstrates the versatility and effectiveness of the PSO.Experimental results are,however,used to show the strong and weak parts of PSO,and performance results are included in tables for ease of comparison.The results stress PSO’s efficiency in providing optimal solutions but also show that there are aspects that need to be improved through combination with algorithms or tuning to the parameters of the method.The review of the advantages and limitations of PSO is intended to provide academics and practitioners with a well-rounded view of the methods of employing such a tool most effectively and to encourage optimized designs of PSO in solving theoretical and practical problems in the future.展开更多
Optimal power flow(OPF)is one of the key tools for optimal operation and planning of modern power systems.Due to the high complexity with continuous and discrete control variables,modern heuristic optimization algorit...Optimal power flow(OPF)is one of the key tools for optimal operation and planning of modern power systems.Due to the high complexity with continuous and discrete control variables,modern heuristic optimization algorithms(HOAs)have been widely employed for the solution of OPF.This paper provides an overview of the latest applications of advanced HOAs in OPF problems.The most frequently applied HOAs for solving the OPF problem in recent years are covered and briefly introduced,including genetic algorithm(GA),differential evolution(DE),particle swarm optimization(PSO),and evolutionary programming(EP),etc.展开更多
Developing an accurate and efficient comprehensive water quality prediction model and its assessment method is crucial for the prevention and control of water pollution.Deep learning(DL),as one of the most promising t...Developing an accurate and efficient comprehensive water quality prediction model and its assessment method is crucial for the prevention and control of water pollution.Deep learning(DL),as one of the most promising technologies today,plays a crucial role in the effective assessment of water body health,which is essential for water resource management.This study models using both the original dataset and a dataset augmented with Generative Adversarial Networks(GAN).It integrates optimization algorithms(OA)with Convolutional Neural Networks(CNN)to propose a comprehensive water quality model evaluation method aiming at identifying the optimal models for different pollutants.Specifically,after preprocessing the spectral dataset,data augmentation was conducted to obtain two datasets.Then,six new models were developed on these datasets using particle swarm optimization(PSO),genetic algorithm(GA),and simulated annealing(SA)combined with CNN to simulate and forecast the concentrations of three water pollutants:Chemical Oxygen Demand(COD),Total Nitrogen(TN),and Total Phosphorus(TP).Finally,seven model evaluation methods,including uncertainty analysis,were used to evaluate the constructed models and select the optimal models for the three pollutants.The evaluation results indicate that the GPSCNN model performed best in predicting COD and TP concentrations,while the GGACNN model excelled in TN concentration prediction.Compared to existing technologies,the proposed models and evaluation methods provide a more comprehensive and rapid approach to water body prediction and assessment,offering new insights and methods for water pollution prevention and control.展开更多
In contemporary geotechnical projects,various approaches are employed for forecasting the settlement of shallow foundations(S_(m)).However,achieving precise modeling of foundation behavior using certain techniques(suc...In contemporary geotechnical projects,various approaches are employed for forecasting the settlement of shallow foundations(S_(m)).However,achieving precise modeling of foundation behavior using certain techniques(such as analytical,numerical,and regression)is challenging and sometimes unattainable.This is primarily due to the inherent nonlinearity of the model,the intricate nature of geotechnical materials,the complex interaction between soil and foundation,and the inherent uncertainty in soil parameters.Therefore,thesemethods often introduce assumptions and simplifications,resulting in relationships that deviate from the actual problem’s reality.In addition,many of these methods demand significant investments of time and resources but neglect to account for the uncertainty inherent in soil/rock parameters.This study explores the application of innovative intelligent techniques to predict S_(m) to address these shortcomings.Specifically,two optimization algorithms,namely teaching-learning-based optimization(TLBO)and harmony search(HS),are harnessed for this purpose.The modeling process involves utilizing input parameters,such as thewidth of the footing(B),the pressure exerted on the footing(q),the count of SPT(Standard Penetration Test)blows(N),the ratio of footing embedment(Df/B),and the footing’s geometry(L/B),during the training phase with a dataset comprising 151 data points.Then,the models’accuracy is assessed during the testing phase using statistical metrics,including the coefficient of determination(R^(2)),mean square error(MSE),and rootmean square error(RMSE),based on a dataset of 38 data points.The findings of this investigation underscore the substantial efficacy of intelligent optimization algorithms as valuable tools for geotechnical engineers when estimating S_(m).In addition,a sensitivity analysis of the input parameters in S_(m) estimation is conducted using@RISK software,revealing that among the various input parameters,the N exerts the most pronounced influence on S_(m).展开更多
文摘Heuristic optimization algorithms have been widely used in solving complex optimization problems in various fields such as engineering,economics,and computer science.These algorithms are designed to find high-quality solutions efficiently by balancing exploration of the search space and exploitation of promising solutions.While heuristic optimization algorithms vary in their specific details,they often exhibit common patterns that are essential to their effectiveness.This paper aims to analyze and explore common patterns in heuristic optimization algorithms.Through a comprehensive review of the literature,we identify the patterns that are commonly observed in these algorithms,including initialization,local search,diversity maintenance,adaptation,and stochasticity.For each pattern,we describe the motivation behind it,its implementation,and its impact on the search process.To demonstrate the utility of our analysis,we identify these patterns in multiple heuristic optimization algorithms.For each case study,we analyze how the patterns are implemented in the algorithm and how they contribute to its performance.Through these case studies,we show how our analysis can be used to understand the behavior of heuristic optimization algorithms and guide the design of new algorithms.Our analysis reveals that patterns in heuristic optimization algorithms are essential to their effectiveness.By understanding and incorporating these patterns into the design of new algorithms,researchers can develop more efficient and effective optimization algorithms.
基金supported by the National Natural Science Foundation of China(22408227,22238005)the Postdoctoral Research Foundation of China(GZC20231576).
文摘The optimization of reaction processes is crucial for the green, efficient, and sustainable development of the chemical industry. However, how to address the problems posed by multiple variables, nonlinearities, and uncertainties during optimization remains a formidable challenge. In this study, a strategy combining interpretable machine learning with metaheuristic optimization algorithms is employed to optimize the reaction process. First, experimental data from a biodiesel production process are collected to establish a database. These data are then used to construct a predictive model based on artificial neural network (ANN) models. Subsequently, interpretable machine learning techniques are applied for quantitative analysis and verification of the model. Finally, four metaheuristic optimization algorithms are coupled with the ANN model to achieve the desired optimization. The research results show that the methanol: palm fatty acid distillate (PFAD) molar ratio contributes the most to the reaction outcome, accounting for 41%. The ANN-simulated annealing (SA) hybrid method is more suitable for this optimization, and the optimal process parameters are a catalyst concentration of 3.00% (mass), a methanol: PFAD molar ratio of 8.67, and a reaction time of 30 min. This study provides deeper insights into reaction process optimization, which will facilitate future applications in various reaction optimization processes.
基金National Natural Science Foundation of China (60674074)Natural Science Foundation of Jiangsu province (BK2009415)+5 种基金Research Fund for the Doctoral Program of Higher Education of China (20093228110002)College Graduate Student Research and Innovation Program of Jiangsu province (CX09B_227Z)Meteorology Industry Special Project of CMA (GYHY(QX)2007-6-2)National 863 Project (2007AA061901)Project of State Key Laboratory of Severe Weather of Chinese Academy of Meteorological Sciences (2008LASW-B11)Project 2009Y0006
文摘Storm identification and tracking based on weather radar data are essential to nowcasting and severe weather warning. A new two-dimensional storm identification method simultaneously seeking in two directions is proposed, and identification results are used to discuss storm tracking algorithms. Three modern optimization algorithms （simulated annealing algorithm, genetic algorithm and ant colony algorithm） are tested to match storms in successive time intervals. Preliminary results indicate that the simulated annealing algorithm and ant colony algorithm are effective and have intuitionally adjustable parameters, whereas the genetic algorithm is unsatisfaetorily constrained by the mode of genetic operations Experiments provide not only the feasibility and characteristics of storm tracking with modern optimization algorithms, but also references for studies and applications in relevant fields.
文摘Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as industry,automotive,construction,machinery,and interdisciplinary research.However,there are established optimization techniques that have shown effectiveness in addressing these types of issues.This research paper gives a comparative study of the implementation of seventeen new metaheuristic methods in order to optimize twelve distinct engineering design issues.The algorithms used in the study are listed as:transient search optimization(TSO),equilibrium optimizer(EO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),slimemould algorithm(SMA),harris hawks optimization(HHO),chimp optimization algorithm(COA),coot optimization algorithm(COOT),multi-verse optimization(MVO),arithmetic optimization algorithm(AOA),aquila optimizer(AO),sine cosine algorithm(SCA),smell agent optimization(SAO),and seagull optimization algorithm(SOA),pelican optimization algorithm(POA),and coati optimization algorithm(CA).As far as we know,there is no comparative analysis of recent and popular methods against the concrete conditions of real-world engineering problems.Hence,a remarkable research guideline is presented in the study for researchersworking in the fields of engineering and artificial intelligence,especiallywhen applying the optimization methods that have emerged recently.Future research can rely on this work for a literature search on comparisons of metaheuristic optimization methods in real-world problems under similar conditions.
基金The author extends his appreciation to theDeputyship forResearch&Innovation,Ministry of Education,Saudi Arabia for funding this research work through the Project Number(QUIF-4-3-3-33891)。
文摘Statistical distributions are used to model wind speed,and the twoparameters Weibull distribution has proven its effectiveness at characterizing wind speed.Accurate estimation of Weibull parameters,the scale(c)and shape(k),is crucial in describing the actual wind speed data and evaluating the wind energy potential.Therefore,this study compares the most common conventional numerical(CN)estimation methods and the recent intelligent optimization algorithms(IOA)to show how precise estimation of c and k affects the wind energy resource assessments.In addition,this study conducts technical and economic feasibility studies for five sites in the northern part of Saudi Arabia,namely Aljouf,Rafha,Tabuk,Turaif,and Yanbo.Results exhibit that IOAs have better performance in attaining optimal Weibull parameters and provided an adequate description of the observed wind speed data.Also,with six wind turbine technologies rating between 1 and 3MW,the technical and economic assessment results reveal that the CN methods tend to overestimate the energy output and underestimate the cost of energy($/kWh)compared to the assessments by IOAs.The energy cost analyses show that Turaif is the windiest site,with an electricity cost of$0.016906/kWh.The highest wind energy output is obtained with the wind turbine having a rated power of 2.5 MW at all considered sites with electricity costs not exceeding$0.02739/kWh.Finally,the outcomes of this study exhibit the potential of wind energy in Saudi Arabia,and its environmental goals can be acquired by harvesting wind energy.
文摘This paper systematically evaluates and compares three well-engineered and popular multi-objective optimization algorithms for the design of switched reluctance machines.The multi-physics and multi-objective nature of electric machine design problems are discussed,followed by benchmark studies comparing generic algorithms(GA),differential evolution(DE)algorithms and particle swarm optimizations(PSO)on a 6/4 switched reluctance machine design with seven independent variables and a strong nonlinear multi-objective Pareto front.To better quantify the quality of the Pareto fronts,five primary quality indicators are employed to serve as the algorithm testing metrics.The results show that the three algorithms have similar performances when the optimization employs only a small number of candidate designs or ultimately,a significant amount of candidate designs.However,DE tends to perform better in terms of convergence speed and the quality of Pareto front when a relatively modest amount of candidates are considered.
基金Project(2006BAC07B03) supported by the National Key Technology R & D Program of ChinaProject(2006G040-A) supported by the Foundation of the Science and Technology Section of Ministry of RailwayProject(2008yb044) supported by the Foundation of Excellent Doctoral Dissertation of Central South University
文摘To protect trains against strong cross-wind along Qinghai-Tibet railway, a strong wind speed monitoring and warning system was developed. And to obtain high-precision wind speed short-term forecasting values for the system to make more accurate scheduling decision, two optimization algorithms were proposed. Using them to make calculative examples for actual wind speed time series from the 18th meteorological station, the results show that: the optimization algorithm based on wavelet analysis method and improved time series analysis method can attain high-precision multi-step forecasting values, the mean relative errors of one-step, three-step, five-step and ten-step forecasting are only 0.30%, 0.75%, 1.15% and 1.65%, respectively. The optimization algorithm based on wavelet analysis method and Kalman time series analysis method can obtain high-precision one-step forecasting values, the mean relative error of one-step forecasting is reduced by 61.67% to 0.115%. The two optimization algorithms both maintain the modeling simple character, and can attain prediction explicit equations after modeling calculation.
文摘The vehicle routing problem(VRP)is a typical discrete combinatorial optimization problem,and many models and algorithms have been proposed to solve the VRP and its variants.Although existing approaches have contributed significantly to the development of this field,these approaches either are limited in problem size or need manual intervention in choosing parameters.To solve these difficulties,many studies have considered learning-based optimization(LBO)algorithms to solve the VRP.This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches.We performed a statistical analysis of the reviewed articles from various aspects and designed three experiments to evaluate the performance of four representative LBO algorithms.Finally,we conclude the applicable types of problems for different LBO algorithms and suggest directions in which researchers can improve LBO algorithms.
文摘In this paper, we develop a new theoretical framework by means of the absorbing Markov process theory for analyzing some stochastic global optimization algorithms. Applying the framework to the pure random search, we prove that the pure random search converges to the global minimum in probability and its time has geometry distribution. We also analyze the pure adaptive search by this framework and turn out that the pure adaptive search converges to the global minimum in probability and its time has Poisson distribution.
基金supported by the National Natural Science Foundation of China (10832004 and 10672084).
文摘Based on the trajectory design of a mission to Saturn, this paper discusses four different trajectories in various swingby cases. We assume a single impulse to be applied in each case when the spacecraft approaches a celestial body. Some optimal trajectories ofEJS, EMS, EVEJS and EVVEJS flying sequences are obtained using five global optimization algorithms： DE, PSO, DP, the hybrid algorithm PSODE and another hybrid algorithm, DPDE. DE is proved to be supe- rior to other non-hybrid algorithms in the trajectory optimi- zation problem. The hybrid algorithm of PSO and DE can improve the optimization performance of DE, which is vali- dated by the mission to Saturn with given swingby sequences. Finally, the optimization results of four different swingby sequences are compared with those of the ACT of ESA.
基金supported by the National Natural Science Foundation of China(Grant No.52374153).
文摘Traditional laboratory tests for measuring rock uniaxial compressive strength(UCS)are tedious and timeconsuming.There is a pressing need for more effective methods to determine rock UCS,especially in deep mining environments under high in-situ stress.Thus,this study aims to develop an advanced model for predicting the UCS of rockmaterial in deepmining environments by combining three boosting-basedmachine learning methods with four optimization algorithms.For this purpose,the Lead-Zinc mine in Southwest China is considered as the case study.Rock density,P-wave velocity,and point load strength index are used as input variables,and UCS is regarded as the output.Subsequently,twelve hybrid predictive models are obtained.Root mean square error(RMSE),mean absolute error(MAE),coefficient of determination(R2),and the proportion of the mean absolute percentage error less than 20%(A-20)are selected as the evaluation metrics.Experimental results showed that the hybridmodel consisting of the extreme gradient boostingmethod and the artificial bee colony algorithm(XGBoost-ABC)achieved satisfactory results on the training dataset and exhibited the best generalization performance on the testing dataset.The values of R2,A-20,RMSE,and MAE on the training dataset are 0.98,1.0,3.11 MPa,and 2.23MPa,respectively.The highest values of R2 and A-20(0.93 and 0.96),and the smallest RMSE and MAE values of 4.78 MPa and 3.76MPa,are observed on the testing dataset.The proposed hybrid model can be considered a reliable and effective method for predicting rock UCS in deep mines.
基金the National Natural Science Foundation of China(No.62176146)。
文摘A multi-strategy hybrid whale optimization algorithm(MSHWOA)for complex constrained optimization problems is proposed to overcome the drawbacks of easily trapping into local optimum,slow convergence speed and low optimization precision.Firstly,the population is initialized by introducing the theory of good point set,which increases the randomness and diversity of the population and lays the foundation for the global optimization of the algorithm.Then,a novel linearly update equation of convergence factor is designed to coordinate the abilities of exploration and exploitation.At the same time,the global exploration and local exploitation capabilities are improved through the siege mechanism of Harris Hawks optimization algorithm.Finally,the simulation experiments are conducted on the 6 benchmark functions and Wilcoxon rank sum test to evaluate the optimization performance of the improved algorithm.The experimental results show that the proposed algorithm has more significant improvement in optimization accuracy,convergence speed and robustness than the comparison algorithm.
基金supported by the National Natural Science Foundation of China (Grant Nos. 91748112,61991403,61991404,and 61991400)。
文摘In this paper, we consider the distributed optimization problem, where the goal is to minimize the global objective function formed by a sum of agents' local smooth and strongly convex objective functions, over undirected connected graphs. Several distributed accelerated algorithms have been proposed for solving such a problem in the existing literature. In this paper, we provide insights for understanding these existing distributed algorithms from an ordinary differential equation(ODE) point of view. More specifically, we first derive an equivalent second-order ODE, which is the exact limit of these existing algorithms by taking the small step-size. Moreover, focusing on the quadratic objective functions, we show that the solution of the resulting ODE exponentially converges to the unique global optimal solution. The theoretical results are validated and illustrated by numerical simulations.
基金supported by the National Natural Science Foundation of China(No.62076225)the Natural Science Foundation of Guangxi Province(No.2020JJA170038)the High-Level Talents Research Project of Beibu Gulf(No.2020KYQD06).
文摘Nonlinear Equations(NEs),which may usually have multiple roots,are ubiquitous in diverse fields.One of the main purposes of solving NEs is to locate as many roots as possible simultaneously in a single run,however,it is a difficult and challenging task in numerical computation.In recent years,Intelligent Optimization Algorithms(IOAs)have shown to be particularly effective in solving NEs.This paper provides a comprehensive survey on IOAs that have been exploited to locate multiple roots of NEs.This paper first revisits the fundamental definition of NEs and reviews the most recent development of the transformation techniques.Then,solving NEs with IOAs is reviewed,followed by the benchmark functions and the performance comparison of several state-of-the-art algorithms.Finally,this paper points out the challenges and some possible open issues for solving NEs.
基金the funding supported by China Scholarship Council(Nos.202008440524 and 202006370006)partially supported by the Distinguished Youth Science Foundation of Hunan Province of China(No.2022JJ10073)+1 种基金the Innovation Driven Project of Central South University(No.2020CX040)Shenzhen Science and Technology Plan(No.JCYJ20190808123013260).
文摘The utilization of recycled aggregates(RA)for concrete production has the potential to offer substantial environmental and economic advantages.However,RA concrete is plagued with considerable durability concerns,particularly carbonation.To advance the application of RA concrete,the establishment of a reliable model for predicting the carbonation is needed.On the one hand,concrete carbonation is a long and slow process and thus consumes a lot of time and energy to monitor.On the other hand,carbonation is influenced by many factors and is hard to predict.Regarding this,this paper proposes the use of machine learning techniques to establish accurate prediction models for the carbonation depth(CD)of RA concrete.Three types of regression techniques and meta-heuristic algorithms were employed to provide more alternative predictive tools.It was found that the best prediction performance was obtained from extreme gradient boosting-multi-universe optimizer(XGB-MVO)with R^(2) value of 0.9949 and 0.9398 for training and testing sets,respectively.XGB-MVO was used for evaluating physical laws of carbonation and it was found that the developed XGB-MVO model could provide reasonable predictions when new data were investigated.It also showed better generalization capabilities when compared with different models in the literature.Overall,this paper emphasizes the need for sustainable solutions in the construction industry to reduce its environmental impact and contribute to sustainable and low-carbon economies.
文摘Shear failure of slender reinforced concrete beams without stirrups has surely been a complicated occurrence that has proven challenging to adequately understand.The primary purpose of this work is to develop machine learning models capable of reliably predicting the shear strength of non-shear-reinforced slender beams(SB).A database encompassing 1118 experimental findings from the relevant literature was compiled,containing eight distinct factors.Gradient Boosting(GB)technique was developed and evaluated in combination with three different optimization algorithms,namely Particle Swarm Optimization(PSO),Random Annealing Optimization(RA),and Simulated Annealing Optimization(SA).The findings suggested that GB-SA could deliver strong prediction results and effectively generalizes the connection between the input and output variables.Shap values and two-dimensional PDP analysis were then carried out.Engineers may use the findings in this work to define beam’s geometrical components and material used to achieve the desired shear strength of SB without reinforcement.
文摘Particle Swarm Optimization(PSO)has been utilized as a useful tool for solving intricate optimization problems for various applications in different fields.This paper attempts to carry out an update on PSO and gives a review of its recent developments and applications,but also provides arguments for its efficacy in resolving optimization problems in comparison with other algorithms.Covering six strategic areas,which include Data Mining,Machine Learning,Engineering Design,Energy Systems,Healthcare,and Robotics,the study demonstrates the versatility and effectiveness of the PSO.Experimental results are,however,used to show the strong and weak parts of PSO,and performance results are included in tables for ease of comparison.The results stress PSO’s efficiency in providing optimal solutions but also show that there are aspects that need to be improved through combination with algorithms or tuning to the parameters of the method.The review of the advantages and limitations of PSO is intended to provide academics and practitioners with a well-rounded view of the methods of employing such a tool most effectively and to encourage optimized designs of PSO in solving theoretical and practical problems in the future.
基金This work was partially supported by Hong Kong RGC Theme Based Research Scheme Grants No.T23-407/13 N and T23-701/14 N.
文摘Optimal power flow(OPF)is one of the key tools for optimal operation and planning of modern power systems.Due to the high complexity with continuous and discrete control variables,modern heuristic optimization algorithms(HOAs)have been widely employed for the solution of OPF.This paper provides an overview of the latest applications of advanced HOAs in OPF problems.The most frequently applied HOAs for solving the OPF problem in recent years are covered and briefly introduced,including genetic algorithm(GA),differential evolution(DE),particle swarm optimization(PSO),and evolutionary programming(EP),etc.
基金Supported by Natural Science Basic Research Plan in Shaanxi Province of China(Program No.2022JM-396)the Strategic Priority Research Program of the Chinese Academy of Sciences,Grant No.XDA23040101+4 种基金Shaanxi Province Key Research and Development Projects(Program No.2023-YBSF-437)Xi'an Shiyou University Graduate Student Innovation Fund Program(Program No.YCX2412041)State Key Laboratory of Air Traffic Management System and Technology(SKLATM202001)Tianjin Education Commission Research Program Project(2020KJ028)Fundamental Research Funds for the Central Universities(3122019132)。
文摘Developing an accurate and efficient comprehensive water quality prediction model and its assessment method is crucial for the prevention and control of water pollution.Deep learning(DL),as one of the most promising technologies today,plays a crucial role in the effective assessment of water body health,which is essential for water resource management.This study models using both the original dataset and a dataset augmented with Generative Adversarial Networks(GAN).It integrates optimization algorithms(OA)with Convolutional Neural Networks(CNN)to propose a comprehensive water quality model evaluation method aiming at identifying the optimal models for different pollutants.Specifically,after preprocessing the spectral dataset,data augmentation was conducted to obtain two datasets.Then,six new models were developed on these datasets using particle swarm optimization(PSO),genetic algorithm(GA),and simulated annealing(SA)combined with CNN to simulate and forecast the concentrations of three water pollutants:Chemical Oxygen Demand(COD),Total Nitrogen(TN),and Total Phosphorus(TP).Finally,seven model evaluation methods,including uncertainty analysis,were used to evaluate the constructed models and select the optimal models for the three pollutants.The evaluation results indicate that the GPSCNN model performed best in predicting COD and TP concentrations,while the GGACNN model excelled in TN concentration prediction.Compared to existing technologies,the proposed models and evaluation methods provide a more comprehensive and rapid approach to water body prediction and assessment,offering new insights and methods for water pollution prevention and control.
文摘In contemporary geotechnical projects,various approaches are employed for forecasting the settlement of shallow foundations(S_(m)).However,achieving precise modeling of foundation behavior using certain techniques(such as analytical,numerical,and regression)is challenging and sometimes unattainable.This is primarily due to the inherent nonlinearity of the model,the intricate nature of geotechnical materials,the complex interaction between soil and foundation,and the inherent uncertainty in soil parameters.Therefore,thesemethods often introduce assumptions and simplifications,resulting in relationships that deviate from the actual problem’s reality.In addition,many of these methods demand significant investments of time and resources but neglect to account for the uncertainty inherent in soil/rock parameters.This study explores the application of innovative intelligent techniques to predict S_(m) to address these shortcomings.Specifically,two optimization algorithms,namely teaching-learning-based optimization(TLBO)and harmony search(HS),are harnessed for this purpose.The modeling process involves utilizing input parameters,such as thewidth of the footing(B),the pressure exerted on the footing(q),the count of SPT(Standard Penetration Test)blows(N),the ratio of footing embedment(Df/B),and the footing’s geometry(L/B),during the training phase with a dataset comprising 151 data points.Then,the models’accuracy is assessed during the testing phase using statistical metrics,including the coefficient of determination(R^(2)),mean square error(MSE),and rootmean square error(RMSE),based on a dataset of 38 data points.The findings of this investigation underscore the substantial efficacy of intelligent optimization algorithms as valuable tools for geotechnical engineers when estimating S_(m).In addition,a sensitivity analysis of the input parameters in S_(m) estimation is conducted using@RISK software,revealing that among the various input parameters,the N exerts the most pronounced influence on S_(m).
