Magnificent Frigatebird Optimization: A New Bio-Inspired Metaheuristic Approach for Solving Optimization Problems

This paper introduces a groundbreaking metaheuristic algorithm named Magnificent Frigatebird Optimization(MFO),inspired by the unique behaviors observed in magnificent frigatebirds in their natural habitats.The foundation of MFO is based on the kleptoparasitic behavior of these birds,where they steal prey from other seabirds.In this process,a magnificent frigatebird targets a food-carrying seabird,aggressively pecking at it until the seabird drops its prey.The frigatebird then swiftly dives to capture the abandoned prey before it falls into the water.The theoretical framework of MFO is thoroughly detailed and mathematically represented,mimicking the frigatebird’s kleptoparasitic behavior in two distinct phases:exploration and exploitation.During the exploration phase,the algorithm searches for new potential solutions across a broad area,akin to the frigatebird scouting for vulnerable seabirds.In the exploitation phase,the algorithm fine-tunes the solutions,similar to the frigatebird focusing on a single target to secure its meal.To evaluate MFO’s performance,the algorithm is tested on twenty-three standard benchmark functions,including unimodal,high-dimensional multimodal,and fixed-dimensional multimodal types.The results from these evaluations highlight MFO’s proficiency in balancing exploration and exploitation throughout the optimization process.Comparative studies with twelve well-known metaheuristic algo-rithms demonstrate that MFO consistently achieves superior optimization results,outperforming its competitors across various metrics.In addition,the implementation of MFO on four engineering design problems shows the effectiveness of the proposed approach in handling real-world applications,thereby validating its practical utility and robustness.

MOALG: A Metaheuristic Hybrid of Multi-Objective Ant Lion Optimizer and Genetic Algorithm for Solving Design Problems

This study proposes a hybridization of two efficient algorithm’s Multi-objective Ant Lion Optimizer Algorithm(MOALO)which is a multi-objective enhanced version of the Ant Lion Optimizer Algorithm(ALO)and the Genetic Algorithm(GA).MOALO version has been employed to address those problems containing many objectives and an archive has been employed for retaining the non-dominated solutions.The uniqueness of the hybrid is that the operators like mutation and crossover of GA are employed in the archive to update the solutions and later those solutions go through the process of MOALO.A first-time hybrid of these algorithms is employed to solve multi-objective problems.The hybrid algorithm overcomes the limitation of ALO of getting caught in the local optimum and the requirement of more computational effort to converge GA.To evaluate the hybridized algorithm’s performance,a set of constrained,unconstrained test problems and engineering design problems were employed and compared with five well-known computational algorithms-MOALO,Multi-objective Crystal Structure Algorithm(MOCryStAl),Multi-objective Particle Swarm Optimization(MOPSO),Multi-objective Multiverse Optimization Algorithm(MOMVO),Multi-objective Salp Swarm Algorithm(MSSA).The outcomes of five performance metrics are statistically analyzed and the most efficient Pareto fronts comparison has been obtained.The proposed hybrid surpasses MOALO based on the results of hypervolume(HV),Spread,and Spacing.So primary objective of developing this hybrid approach has been achieved successfully.The proposed approach demonstrates superior performance on the test functions,showcasing robust convergence and comprehensive coverage that surpasses other existing algorithms.

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.

BHJO: A Novel Hybrid Metaheuristic Algorithm Combining the Beluga Whale, Honey Badger, and Jellyfish Search Optimizers for Solving Engineering Design Problems

Hybridizing metaheuristic algorithms involves synergistically combining different optimization techniques to effectively address complex and challenging optimization problems.This approach aims to leverage the strengths of multiple algorithms,enhancing solution quality,convergence speed,and robustness,thereby offering a more versatile and efficient means of solving intricate real-world optimization tasks.In this paper,we introduce a hybrid algorithm that amalgamates three distinct metaheuristics:the Beluga Whale Optimization(BWO),the Honey Badger Algorithm(HBA),and the Jellyfish Search(JS)optimizer.The proposed hybrid algorithm will be referred to as BHJO.Through this fusion,the BHJO algorithm aims to leverage the strengths of each optimizer.Before this hybridization,we thoroughly examined the exploration and exploitation capabilities of the BWO,HBA,and JS metaheuristics,as well as their ability to strike a balance between exploration and exploitation.This meticulous analysis allowed us to identify the pros and cons of each algorithm,enabling us to combine them in a novel hybrid approach that capitalizes on their respective strengths for enhanced optimization performance.In addition,the BHJO algorithm incorporates Opposition-Based Learning(OBL)to harness the advantages offered by this technique,leveraging its diverse exploration,accelerated convergence,and improved solution quality to enhance the overall performance and effectiveness of the hybrid algorithm.Moreover,the performance of the BHJO algorithm was evaluated across a range of both unconstrained and constrained optimization problems,providing a comprehensive assessment of its efficacy and applicability in diverse problem domains.Similarly,the BHJO algorithm was subjected to a comparative analysis with several renowned algorithms,where mean and standard deviation values were utilized as evaluation metrics.This rigorous comparison aimed to assess the performance of the BHJOalgorithmabout its counterparts,shedding light on its effectiveness and reliability in solving optimization problems.Finally,the obtained numerical statistics underwent rigorous analysis using the Friedman post hoc Dunn’s test.The resulting numerical values revealed the BHJO algorithm’s competitiveness in tackling intricate optimization problems,affirming its capability to deliver favorable outcomes in challenging scenarios.

Systematic Review:Load Balancing in Cloud Computing by Using Metaheuristic Based Dynamic Algorithms

Cloud Computing has the ability to provide on-demand access to a shared resource pool.It has completely changed the way businesses are managed,implement applications,and provide services.The rise in popularity has led to a significant increase in the user demand for services.However,in cloud environments efficient load balancing is essential to ensure optimal performance and resource utilization.This systematic review targets a detailed description of load balancing techniques including static and dynamic load balancing algorithms.Specifically,metaheuristic-based dynamic load balancing algorithms are identified as the optimal solution in case of increased traffic.In a cloud-based context,this paper describes load balancing measurements,including the benefits and drawbacks associated with the selected load balancing techniques.It also summarizes the algorithms based on implementation,time complexity,adaptability,associated issue(s),and targeted QoS parameters.Additionally,the analysis evaluates the tools and instruments utilized in each investigated study.Moreover,comparative analysis among static,traditional dynamic and metaheuristic algorithms based on response time by using the CloudSim simulation tool is also performed.Finally,the key open problems and potential directions for the state-of-the-art metaheuristic-based approaches are also addressed.

Optimizing a Transportation System Using Metaheuristics Approaches (EGD/GA/ACO): A Forest Vehicle Routing Case Study

The large-scale optimization problem requires some optimization techniques, and the Metaheuristics approach is highly useful for solving difficult optimization problems in practice. The purpose of the research is to optimize the transportation system with the help of this approach. We selected forest vehicle routing data as the case study to minimize the total cost and the distance of the forest transportation system. Matlab software helps us find the best solution for this case by applying three algorithms of Metaheuristics: Genetic Algorithm (GA), Ant Colony Optimization (ACO), and Extended Great Deluge (EGD). The results show that GA, compared to ACO and EGD, provides the best solution for the cost and the length of our case study. EGD is the second preferred approach, and ACO offers the last solution.

Stability prediction of hard rock pillar using support vector machine optimized by three metaheuristic algorithms

Hard rock pillar is one of the important structures in engineering design and excavation in underground mines.Accurate and convenient prediction of pillar stability is of great significance for underground space safety.This paper aims to develop hybrid support vector machine(SVM)models improved by three metaheuristic algorithms known as grey wolf optimizer(GWO),whale optimization algorithm(WOA)and sparrow search algorithm(SSA)for predicting the hard rock pillar stability.An integrated dataset containing 306 hard rock pillars was established to generate hybrid SVM models.Five parameters including pillar height,pillar width,ratio of pillar width to height,uniaxial compressive strength and pillar stress were set as input parameters.Two global indices,three local indices and the receiver operating characteristic(ROC)curve with the area under the ROC curve(AUC)were utilized to evaluate all hybrid models’performance.The results confirmed that the SSA-SVM model is the best prediction model with the highest values of all global indices and local indices.Nevertheless,the performance of the SSASVM model for predicting the unstable pillar(AUC:0.899)is not as good as those for stable(AUC:0.975)and failed pillars(AUC:0.990).To verify the effectiveness of the proposed models,5 field cases were investigated in a metal mine and other 5 cases were collected from several published works.The validation results indicated that the SSA-SVM model obtained a considerable accuracy,which means that the combination of SVM and metaheuristic algorithms is a feasible approach to predict the pillar stability.

Skill Optimization Algorithm:A New Human-Based Metaheuristic Technique

Metaheuristic algorithms are widely used in solving optimization problems.In this paper,a new metaheuristic algorithm called Skill Optimization Algorithm(SOA)is proposed to solve optimization problems.The fundamental inspiration in designing SOA is human efforts to acquire and improve skills.Various stages of SOA are mathematically modeled in two phases,including:(i)exploration,skill acquisition from experts and(ii)exploitation,skill improvement based on practice and individual effort.The efficiency of SOA in optimization applications is analyzed through testing this algorithm on a set of twenty-three standard benchmark functions of a variety of unimodal,high-dimensional multimodal,and fixed-dimensional multimodal types.The optimization results show that SOA,by balancing exploration and exploitation,is able to provide good performance and appropriate solutions for optimization problems.In addition,the performance of SOA in optimization is compared with ten metaheuristic algorithms to evaluate the quality of the results obtained by the proposed approach.Analysis and comparison of the obtained simulation results show that the proposed SOA has a superior performance over the considered algorithms and achievesmuch more competitive results.

Metaheuristics-based Clustering with Routing Technique for Lifetime Maximization in Vehicular Networks

Recently,vehicular ad hoc networks(VANETs)finds applicability in different domains such as security,rescue operations,intelligent transportation systems(ITS),etc.VANET has unique features like high mobility,limited mobility patterns,adequate topologymodifications,and wireless communication.Despite the benefits of VANET,scalability is a challenging issue which could be addressed by the use of cluster-based routing techniques.It enables the vehicles to perform intercluster communication via chosen CHs and optimal routes.The main drawback of VANET network is the network unsteadiness that results in minimum lifetime.In order to avoid reduced network lifetime in VANET,this paper presents an enhanced metaheuristics based clustering with multihop routing technique for lifetime maximization(EMCMHR-LM)in VANET.The presented EMCMHR-LM model involves the procedure of arranging clusters,cluster head(CH)selection,and route selection appropriate for VANETs.The presentedEMCMHR-LMmodel uses slime mold optimization based clustering(SMO-C)technique to group the vehicles into clusters.Besides,an enhanced wild horse optimization based multihop routing(EWHO-MHR)protocol by the optimization of network parameters.The presented EMCMHR-LMmodel is simulated usingNetwork Simulator(NS3)tool and the simulation outcomes reported the enhanced performance of the proposed EMCMHR-LM technique over the other models.

Al-Biruni Earth Radius(BER)Metaheuristic Search Optimization Algorithm

Metaheuristic optimization algorithms present an effective method for solving several optimization problems from various types of applications and fields.Several metaheuristics and evolutionary optimization algorithms have been emerged recently in the literature and gained widespread attention,such as particle swarm optimization(PSO),whale optimization algorithm(WOA),grey wolf optimization algorithm(GWO),genetic algorithm(GA),and gravitational search algorithm(GSA).According to the literature,no one metaheuristic optimization algorithm can handle all present optimization problems.Hence novel optimization methodologies are still needed.The Al-Biruni earth radius(BER)search optimization algorithm is proposed in this paper.The proposed algorithm was motivated by the behavior of swarm members in achieving their global goals.The search space around local solutions to be explored is determined by Al-Biruni earth radius calculation method.A comparative analysis with existing state-of-the-art optimization algorithms corroborated the findings of BER’s validation and testing against seven mathematical optimization problems.The results show that BER can both explore and avoid local optima.BER has also been tested on an engineering design optimization problem.The results reveal that,in terms of performance and capability,BER outperforms the performance of state-of-the-art metaheuristic optimization algorithms.

Migration Algorithm:A New Human-BasedMetaheuristic Approach for Solving Optimization Problems

This paper introduces a newmetaheuristic algorithmcalledMigration Algorithm(MA),which is helpful in solving optimization problems.The fundamental inspiration of MA is the process of human migration,which aims to improve job,educational,economic,and living conditions,and so on.Themathematicalmodeling of the proposed MAis presented in two phases to empower the proposed approach in exploration and exploitation during the search process.In the exploration phase,the algorithm population is updated based on the simulation of choosing the migration destination among the available options.In the exploitation phase,the algorithm population is updated based on the efforts of individuals in the migration destination to adapt to the new environment and improve their conditions.MA’s performance is evaluated on fifty-two standard benchmark functions consisting of unimodal and multimodal types and the CEC 2017 test suite.In addition,MA’s results are compared with the performance of twelve well-known metaheuristic algorithms.The optimization results show the proposed MA approach’s high ability to balance exploration and exploitation to achieve suitable solutions for optimization problems.The analysis and comparison of the simulation results show that MA has provided superior performance against competitor algorithms in most benchmark functions.Also,the implementation of MA on four engineering design problems indicates the effective capability of the proposed approach in handling optimization tasks in real-world applications.

Improved Supervised and Unsupervised Metaheuristic-Based Approaches to Detect Intrusion in Various Datasets

Due to the increasing number of cyber-attacks,the necessity to develop efficient intrusion detection systems(IDS)is more imperative than ever.In IDS research,the most effectively used methodology is based on supervised Neural Networks(NN)and unsupervised clustering,but there are few works dedicated to their hybridization with metaheuristic algorithms.As intrusion detection data usually contains several features,it is essential to select the best ones appropriately.Linear Discriminant Analysis(LDA)and t-statistic are considered as efficient conventional techniques to select the best features,but they have been little exploited in IDS design.Thus,the research proposed in this paper can be summarized as follows.a)The proposed approach aims to use hybridized unsupervised and hybridized supervised detection processes of all the attack categories in the CICIDS2017 Dataset.Nevertheless,owing to the large size of the CICIDS2017 Dataset,only 25%of the data was used.b)As a feature selection method,the LDAperformancemeasure is chosen and combinedwith the t-statistic.c)For intrusion detection,unsupervised Fuzzy C-means(FCM)clustering and supervised Back-propagation NN are adopted.d)In addition and in order to enhance the suggested classifiers,FCM and NN are hybridized with the seven most known metaheuristic algorithms,including Genetic Algorithm(GA),Particle Swarm Optimization(PSO),Differential Evolution(DE),Cultural Algorithm(CA),Harmony Search(HS),Ant-Lion Optimizer(ALO)and Black Hole(BH)Algorithm.Performance metrics extracted from confusion matrices,such as accuracy,precision,sensitivity and F1-score are exploited.The experimental result for the proposed intrusion detection,based on training and test CICIDS2017 datasets,indicated that PSO,GA and ALO-based NNs can achieve promising results.PSO-NN produces a tested accuracy,global sensitivity and F1-score of 99.97%,99.95%and 99.96%,respectively,outperforming performance concluded in several related works.Furthermore,the best-proposed approaches are valued in the most recent intrusion detection datasets:CSE-CICIDS2018 and LUFlow2020.The evaluation fallouts consolidate the previous results and confirm their correctness.

Metaheuristic Optimization of Time Series Models for Predicting Networks Traffic

Traffic prediction of wireless networks attracted many researchersand practitioners during the past decades. However, wireless traffic frequentlyexhibits strong nonlinearities and complicated patterns, which makes it challengingto be predicted accurately. Many of the existing approaches forpredicting wireless network traffic are unable to produce accurate predictionsbecause they lack the ability to describe the dynamic spatial-temporalcorrelations of wireless network traffic data. In this paper, we proposed anovel meta-heuristic optimization approach based on fitness grey wolf anddipper throated optimization algorithms for boosting the prediction accuracyof traffic volume. The proposed algorithm is employed to optimize the hyperparametersof long short-term memory (LSTM) network as an efficient timeseries modeling approach which is widely used in sequence prediction tasks.To prove the superiority of the proposed algorithm, four other optimizationalgorithms were employed to optimize LSTM, and the results were compared.The evaluation results confirmed the effectiveness of the proposed approachin predicting the traffic of wireless networks accurately. On the other hand,a statistical analysis is performed to emphasize the stability of the proposedapproach.

Novel Optimized Feature Selection Using Metaheuristics Applied to Physical Benchmark Datasets

In data mining and machine learning,feature selection is a critical part of the process of selecting the optimal subset of features based on the target data.There are 2n potential feature subsets for every n features in a dataset,making it difficult to pick the best set of features using standard approaches.Consequently,in this research,a new metaheuristics-based feature selection technique based on an adaptive squirrel search optimization algorithm(ASSOA)has been proposed.When using metaheuristics to pick features,it is common for the selection of features to vary across runs,which can lead to instability.Because of this,we used the adaptive squirrel search to balance exploration and exploitation duties more evenly in the optimization process.For the selection of the best subset of features,we recommend using the binary ASSOA search strategy we developed before.According to the suggested approach,the number of features picked is reduced while maximizing classification accuracy.A ten-feature dataset from the University of California,Irvine(UCI)repository was used to test the proposed method’s performance vs.eleven other state-of-the-art approaches,including binary grey wolf optimization(bGWO),binary hybrid grey wolf and particle swarm optimization(bGWO-PSO),bPSO,binary stochastic fractal search(bSFS),binary whale optimization algorithm(bWOA),binary modified grey wolf optimization(bMGWO),binary multiverse optimization(bMVO),binary bowerbird optimization(bSBO),binary hybrid GWO and genetic algorithm 4028 CMC,2023,vol.74,no.2(bGWO-GA),binary firefly algorithm(bFA),and bGAmethods.Experimental results confirm the superiority and effectiveness of the proposed algorithm for solving the problem of feature selection.

Language Education Optimization: A New Human-Based Metaheuristic Algorithm for Solving Optimization Problems

In this paper,based on the concept of the NFL theorem,that there is no unique algorithm that has the best performance for all optimization problems,a new human-based metaheuristic algorithm called Language Education Optimization(LEO)is introduced,which is used to solve optimization problems.LEO is inspired by the foreign language education process in which a language teacher trains the students of language schools in the desired language skills and rules.LEO is mathematically modeled in three phases:(i)students selecting their teacher,(ii)students learning from each other,and(iii)individual practice,considering exploration in local search and exploitation in local search.The performance of LEO in optimization tasks has been challenged against fifty-two benchmark functions of a variety of unimodal,multimodal types and the CEC 2017 test suite.The optimization results show that LEO,with its acceptable ability in exploration,exploitation,and maintaining a balance between them,has efficient performance in optimization applications and solution presentation.LEO efficiency in optimization tasks is compared with ten well-known metaheuristic algorithms.Analyses of the simulation results show that LEO has effective performance in dealing with optimization tasks and is significantly superior andmore competitive in combating the compared algorithms.The implementation results of the proposed approach to four engineering design problems show the effectiveness of LEO in solving real-world optimization applications.

Billiards Optimization Algorithm:A New Game-Based Metaheuristic Approach

Metaheuristic algorithms are one of themost widely used stochastic approaches in solving optimization problems.In this paper,a new metaheuristic algorithm entitled Billiards Optimization Algorithm(BOA)is proposed and designed to be used in optimization applications.The fundamental inspiration in BOA design is the behavior of the players and the rules of the billiards game.Various steps of BOA are described and then its mathematical model is thoroughly explained.The efficiency of BOA in dealing with optimization problems is evaluated through optimizing twenty-three standard benchmark functions of different types including unimodal,high-dimensional multimodal,and fixed-dimensionalmultimodal functions.In order to analyze the quality of the results obtained by BOA,the performance of the proposed approach is compared with ten well-known algorithms.The simulation results show that BOA,with its high exploration and exploitation abilities,achieves an impressive performance in providing solutions to objective functions and is superior and far more competitive compared to the ten competitor algorithms.

A Metaheuristic Technique for Cluster-Based Feature Selection of DNA Methylation Data for Cancer

Epigenetics is the study of phenotypic variations that do not alter DNA sequences.Cancer epigenetics has grown rapidly over the past few years as epigenetic alterations exist in all human cancers.One of these alterations is DNA methylation;an epigenetic process that regulates gene expression and often occurs at tumor suppressor gene loci in cancer.Therefore,studying this methylation process may shed light on different gene functions that cannot otherwise be interpreted using the changes that occur in DNA sequences.Currently,microarray technologies;such as Illumina Infinium BeadChip assays;are used to study DNA methylation at an extremely large number of varying loci.At each DNA methylation site,a beta value(β)is used to reflect the methylation intensity.Therefore,clustering this data from various types of cancers may lead to the discovery of large partitions that can help objectively classify different types of cancers aswell as identify the relevant loci without user bias.This study proposed a Nested Big Data Clustering Genetic Algorithm(NBDC-GA);a novel evolutionary metaheuristic technique that can perform cluster-based feature selection based on the DNA methylation sites.The efficacy of the NBDC-GA was tested using real-world data sets retrieved from The Cancer Genome Atlas(TCGA);a cancer genomics program created by the NationalCancer Institute(NCI)and the NationalHuman Genome Research Institute.The performance of the NBDC-GA was then compared with that of a recently developed metaheuristic Immuno-Genetic Algorithm(IGA)that was tested using the same data sets.The NBDC-GA outperformed the IGA in terms of convergence performance.Furthermore,the NBDC-GA produced a more robust clustering configuration while simultaneously decreasing the dimensionality of features to a maximumof 67%and of 94.5%for individual cancer type and collective cancer,respectively.The proposed NBDC-GA was also able to identify two chromosomes with highly contrastingDNAmethylations activities that were previously linked to cancer.

A Data-Driven Rutting Depth Short-Time Prediction Model With Metaheuristic Optimization for Asphalt Pavements Based on RIOHTrack

Rutting of asphalt pavements is a crucial design criterion in various pavement design guides. A good road transportation base can provide security for the transportation of oil and gas in road transportation. This study attempts to develop a robust artificial intelligence model to estimate different asphalt pavements’ rutting depth clips, temperature, and load axes as primary characteristics. The experiment data were obtained from19 asphalt pavements with different crude oil sources on a 2.038km long full-scale field accelerated pavement test track(Road Track Institute, RIOHTrack) in Tongzhou, Beijing. In addition,this paper also proposes to build complex networks with different pavement rutting depths through complex network methods and the Louvain algorithm for community detection. The most critical structural elements can be selected from different asphalt pavement rutting data, and similar structural elements can be found. An extreme learning machine algorithm with residual correction(RELM) is designed and optimized using an independent adaptive particle swarm algorithm. The experimental results of the proposed method are compared with several classical machine learning algorithms, with predictions of average root mean squared error(MSE), average mean absolute error(MAE), and a verage mean absolute percentage error(MAPE) for 19 asphalt pavements reaching 1.742, 1.363, and 1.94% respectively. The experiments demonstrate that the RELM algorithm has an advantage over classical machine learning methods in dealing with non-linear problems in road engineering. Notably, the method ensures the adaptation of the simulated environment to different levels of abstraction through the cognitive analysis of the production environment parameters. It is a promising alternative method that facilitates the rapid assessment of pavement conditions and could be applied in the future to production processes in the oil and gas industry.

Dark Forest Algorithm:A Novel Metaheuristic Algorithm for Global Optimization Problems

Metaheuristic algorithms,as effective methods for solving optimization problems,have recently attracted considerable attention in science and engineering fields.They are popular and have broad applications owing to their high efficiency and low complexity.These algorithms are generally based on the behaviors observed in nature,physical sciences,or humans.This study proposes a novel metaheuristic algorithm called dark forest algorithm(DFA),which can yield improved optimization results for global optimization problems.In DFA,the population is divided into four groups:highest civilization,advanced civilization,normal civilization,and low civilization.Each civilization has a unique way of iteration.To verify DFA’s capability,the performance of DFA on 35 well-known benchmark functions is compared with that of six other metaheuristic algorithms,including artificial bee colony algorithm,firefly algorithm,grey wolf optimizer,harmony search algorithm,grasshopper optimization algorithm,and whale optimization algorithm.The results show that DFA provides solutions with improved efficiency for problems with low dimensions and outperforms most other algorithms when solving high dimensional problems.DFAis applied to five engineering projects to demonstrate its applicability.The results show that the performance of DFA is competitive to that of current well-known metaheuristic algorithms.Finally,potential upgrading routes for DFA are proposed as possible future developments.

Airfoil Shape Optimisation Using a Multi-Fidelity Surrogate-Assisted Metaheuristic with a New Multi-Objective Infill Sampling Technique

This work presents multi-fidelity multi-objective infill-sampling surrogate-assisted optimization for airfoil shape optimization.The optimization problem is posed to maximize the lift and drag coefficient ratio subject to airfoil geometry constraints.Computational Fluid Dynamic(CFD)and XFoil tools are used for high and low-fidelity simulations of the airfoil to find the real objective function value.A special multi-objective sub-optimization problem is proposed for multiple points infill sampling exploration to improve the surrogate model constructed.To validate and further assess the proposed methods,a conventional surrogate-assisted optimization method and an infill sampling surrogate-assisted optimization criterion are applied with multi-fidelity simulation,while their numerical performance is investigated.The results obtained show that the proposed technique is the best performer for the demonstrated airfoil shape optimization.According to this study,applying multi-fidelity with multi-objective infill sampling criteria for surrogate-assisted optimization is a powerful design tool.