A Comparative Study of Metaheuristic Optimization Algorithms for Solving Real-World Engineering Design Problems

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.

Uniaxial Compressive Strength Prediction for Rock Material in Deep Mine Using Boosting-Based Machine Learning Methods and Optimization Algorithms

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.

Multi-strategy hybrid whale optimization algorithms for complex constrained optimization problems

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.

EXPERIMENTS TO TRACK STORMS USING MODERN OPTIMIZATION ALGORITHMS

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.

Comparative Analysis for Evaluating Wind Energy Resources Using Intelligent Optimization Algorithms and Numerical Methods

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.

Performance Evaluation and Comparison of Multi - Objective Optimization Algorithms for the Analytical Design of Switched Reluctance Machines

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.

Short-term forecasting optimization algorithms for wind speed along Qinghai-Tibet railway based on different intelligent modeling theories

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.

An Overview and Experimental Study of Learning-Based Optimization Algorithms for the Vehicle Routing Problem

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.

ANew Theoretical Framework forAnalyzing Stochastic Global Optimization 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.

Multi-swingby optimization of mission to Saturn using global optimization algorithms

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.

A comprehensive comparison of different regression techniques and nature-inspired optimization algorithms to predict carbonation depth of recycled aggregate concrete

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.

Distributed accelerated optimization algorithms:Insights from an ODE

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 Solving with Intelligent Optimization Algorithms: A Survey

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.

Predicting shear strength of slender beams without reinforcement using hybrid gradient boosting trees and optimization algorithms

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.

Development of Fixture Layout Optimization for Thin-Walled Parts:A Review

An increasing number of researchers have researched fixture layout optimization for thin-walled part assembly during the past decades.However,few papers systematically review these researches.By analyzing existing literature,this paper summarizes the process of fixture layout optimization and the methods applied.The process of optimization is made up of optimization objective setting,assembly variation/deformation modeling,and fixture layout optimization.This paper makes a review of the fixture layout for thin-walled parts according to these three steps.First,two different kinds of optimization objectives are introduced.Researchers usually consider in-plane variations or out-of-plane deformations when designing objectives.Then,modeling methods for assembly variation and deformation are divided into two categories:Mechanism-based and data-based methods.Several common methods are discussed respectively.After that,optimization algorithms are reviewed systematically.There are two kinds of optimization algorithms:Traditional nonlinear programming and heuristic algorithms.Finally,discussions on the current situation are provided.The research direction of fixture layout optimization in the future is discussed from three aspects:Objective setting,improving modeling accuracy and optimization algorithms.Also,a new research point for fixture layout optimization is discussed.This paper systematically reviews the research on fixture layout optimization for thin-walled parts,and provides a reference for future research in this field.

Large-Scale Multi-Objective Optimization Algorithm Based on Weighted Overlapping Grouping of Decision Variables

The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.

A review on applications of heuristic optimization algorithms for optimal power flow in modern power systems

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.

Optimal integration of DGs into radial distribution network in the presence of plug-in electric vehicles to minimize daily active power losses and to improve the voltage profile of the system using bioinspired optimization algorithms

Purpose:The increase in plug-in electric vehicles(PEVs)is likely to see a noteworthy impact on the distribution system due to high electric power consumption during charging and uncertainty in charging behavior.To address this problem,the present work mainly focuses on optimal integration of distributed generators(DG)into radial distribution systems in the presence of PEV loads with their charging behavior under daily load pattern including load models by considering the daily(24 h)power loss and voltage improvement of the system as objectives for better system performance.Design/methodology/approach:To achieve the desired outcomes,an efficient weighted factor multi-objective function is modeled.Particle Swarm Optimization(PSO)and Butterfly Optimization(BO)algorithms are selected and implemented to minimize the objectives of the system.A repetitive backward-forward sweep-based load flow has been introduced to calculate the daily power loss and bus voltages of the radial distribution system.The simulations are carried out using MATLAB software.Findings:The simulation outcomes reveal that the proposed approach definitely improved the system performance in all aspects.Among PSO and BO,BO is comparatively successful in achieving the desired objectives.Originality/value:The main contribution of this paper is the formulation of the multi-objective function that can address daily active power loss and voltage deviation under 24-h load pattern including grouping of residential,industrial and commercial loads.Introduction of repetitive backward-forward sweep-based load flow and the modeling of PEV load with two different charging scenarios.

Modeling landslide susceptibility based on convolutional neural network coupling with metaheuristic optimization algorithms

Landslides are one of the most common geological hazards worldwide,especially in Sichuan Province(Southwest China).The current study's main,purposes are to explore the potential applications of convolutional neural networks(CNN)hybrid ensemble metaheuristic optimization algorithms,namely beluga whale optimization(BWO)and coati optimization algorithm(COA),for landslide susceptibility mapping in Sichuan Province(China).For this aim,fourteen landslide conditioning factors were compiled in a spatial database.The effectiveness of the conditioning factors in the development of the landslide predictive model was quantified using the linear support vector machine model.The receiver operating characteristic(ROC)curve(AUC),the root mean square error,and six statistical indices were used to test and compare the three resultant models.For the training dataset,the AUC values of the CNN-COA,CNN-BWO and CNN models were 0.946,0.937 and 0.855,respectively.In terms of the validation dataset,the CNN-COA model exhibited a higher AUC value of 0.919,while the AUC values of the CNN-BWO and CNN models were 0.906 and 0.805,respectively.The results indicate that the CNN-COA model,followed by the CNN-BWO model,and the CNN model,offers the best overall performance for landslide susceptibility analysis.

Task Scheduling Optimization in Cloud Computing Based on Genetic Algorithms

Task scheduling is the main problem in cloud computing that reduces system performance;it is an important way to arrange user needs and perform multiple goals.Cloud computing is the most popular technology nowadays and has many research potential in various areas like resource allocation,task scheduling,security,privacy,etc.To improve system performance,an efficient task-scheduling algorithm is required.Existing task-scheduling algorithms focus on task-resource requirements,CPU memory,execution time,and execution cost.In this paper,a task scheduling algorithm based on a Genetic Algorithm(GA)has been presented for assigning and executing different tasks.The proposed algorithm aims to minimize both the completion time and execution cost of tasks and maximize resource utilization.We evaluate our algorithm’s performance by applying it to two examples with a different number of tasks and processors.The first example contains ten tasks and four processors;the computation costs are generated randomly.The last example has eight processors,and the number of tasks ranges from twenty to seventy;the computation cost of each task on different processors is generated randomly.The achieved results show that the proposed approach significantly succeeded in finding the optimal solutions for the three objectives;completion time,execution cost,and resource utilization.