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 ...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.展开更多
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.展开更多
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 o...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.展开更多
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 supervise...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 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 ...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.展开更多
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 impro...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.展开更多
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 safet...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.展开更多
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 O...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.展开更多
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 ...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.展开更多
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 alterati...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.展开更多
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 ...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.展开更多
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 stu...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.展开更多
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 mo...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.展开更多
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 th...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.展开更多
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 subjec...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.展开更多
Recently,Internet of Things(IoT)has been developed into a field of research and it purposes at linking many sensors enabling devices mostly to data collection and track applications.Wireless sensor network(WSN)is a vi...Recently,Internet of Things(IoT)has been developed into a field of research and it purposes at linking many sensors enabling devices mostly to data collection and track applications.Wireless sensor network(WSN)is a vital element of IoT paradigm since its inception and has developed into one of the chosen platforms for deploying many smart city application regions such as disaster management,intelligent transportation,home automation,smart buildings,and other such IoT-based application.The routing approaches were extremely-utilized energy efficient approaches with an initial drive that is,for balancing the energy amongst sensor nodes.The clustering and routing procedures assumed that Non-Polynomial(NP)hard problems but bio-simulated approaches are utilized to a recognized time for resolving such problems.With this motivation,this paper presents a new blockchain with Enhanced Hunger Games Search based Route Planning(BCEHGS-RP)scheme for IoT assisted WSN.The presented BCEHGS-RP model majorly employs BC technology for secure communication in the IoT supportedWSN environment.In addition,an effective multihop route planning approach was designed by the use of EHGS technique.The proposed EHGS technique is derived from the concept of Hill Climbing strategy(HCS)and HGS algorithm.Moreover,a fitness function with two parameters namely residual energy(RE)and intercluster distance to elect optimal routes.The performance validation of the BCEHGS-RP model is experimented with under diverse number of nodes.Extensive experimental outcomes highlighted the better performance of the BCEHGS-RP technique on recent approaches.展开更多
With recent advancements made in wireless communication techniques,wireless sensors have become an essential component in both data collection as well as tracking applications.Wireless Sensor Network(WSN)is an integra...With recent advancements made in wireless communication techniques,wireless sensors have become an essential component in both data collection as well as tracking applications.Wireless Sensor Network(WSN)is an integral part of Internet of Things(IoT)and it encounters different kinds of security issues.Blockchain is designed as a game changer for highly secure and effective digital society.So,the current research paper focuses on the design of Metaheuristic-based Clustering with Routing Protocol for Blockchain-enabled WSN abbreviated as MCRP-BWSN.The proposed MCRP-BWSN technique aims at deriving a shared memory scheme using blockchain technology and determine the optimal paths to reach the destination in clustered WSN.In MCRP-BWSN technique,Chimp Optimization Algorithm(COA)-based clustering technique is designed to elect a proper set of Cluster Heads(CHs)and organize the selected clusters.In addition,Horse Optimization Algorithm(HOA)-based routing technique is also presented to optimally select the routes based onfitness function.Besides,HOA-based routing technique utilizes blockchain technology to avail the shared mem-ory among nodes in the network.Sensor nodes are treated as coins whereas the ownership handles the sensor nodes and Base Station(BS).In order to validate the enhanced performance of the proposed MCRP-BWSN technique,a wide range of simulations was conducted and the results were examined under different measures.Based on the performance exhibited in simulation outcomes,the pro-posed MCRP-BWSN technique has been established as a promising candidate over other existing techniques.展开更多
No optimization algorithm can obtain satisfactory results in all optimization tasks.Thus,it is an effective way to deal with the problem by an ensemble ofmultiple algorithms.This paper proposes an ensemble of populati...No optimization algorithm can obtain satisfactory results in all optimization tasks.Thus,it is an effective way to deal with the problem by an ensemble ofmultiple algorithms.This paper proposes an ensemble of population-based metaheuristics(EPM)to solve single-objective optimization problems.The design of the EPM framework includes three stages:the initial stage,the update stage,and the final stage.The framework applies the transformation of the real and virtual population to balance the problem of exploration and exploitation at the population level and uses an elite strategy to communicate among virtual populations.The experiment tested two benchmark function sets with fivemetaheuristic algorithms and four ensemble algorithms.The ensemble algorithms are generally superior to the original algorithms by Friedman’s average ranking andWilcoxon signed ranking test results,demonstrating the ensemble framework’s effect.By solving the iterative curves of different test functions,we can see that the ensemble algorithms have faster iterative optimization speed and better optimization results.The ensemble algorithms cannot fall into local optimumby virtual populations distribution map of several stages.The ensemble framework performs well from the effects of solving two practical engineering problems.Some results of ensemble algorithms are superior to those of metaheuristic algorithms not included in the ensemble framework,further demonstrating the ensemble method’s potential and superiority.展开更多
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...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.展开更多
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 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.展开更多
基金supported by the National Research Foundation of Korea(NRF)Grant funded by the Korea government(MSIT)(No.RS-2023-00218176)the Soonchunhyang University Research Fund.
文摘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.
文摘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 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.
文摘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.
基金supported by Specific Research project 2022 Faculty of Education,University of Hradec Kralove.
文摘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.
基金supported by the Project of Excellence PˇrFUHKNo.2210/2023-2024,University of Hradec Kralove,Czech Republic.
文摘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.
基金supported by the National Natural Science Foundation Project of China(Nos.72088101 and 42177164)the Distinguished Youth Science Foundation of Hunan Province of China(No.2022JJ10073)The first author was funded by China Scholarship Council(No.202106370038).
文摘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.
基金supported by the Project of Specific Research PˇrF UHK No.2104/2022-2023,University of Hradec Kralove,Czech Republic.
文摘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.
基金The research and article are supported by Specific Research project 2022 Faculty of Education,University of Hradec Králové,Czech Republic.
文摘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.
文摘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.
基金Princess Nourah bint Abdulrahman University Researchers Supporting Project Number (PNURSP2022R323)Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘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.
基金supported by the Analytical Center for the Government of the Russian Federation (IGK 000000D730321P5Q0002) and Agreement Nos.(70-2021-00141)。
文摘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.
文摘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.
基金This work is performed under collaboration with College ofMaterials Science and Chemical Engineering,Harbin Engineering University by the support of National Key Research and Development Program of China(2019YFB1901003)The authors also acknowledge the financial support of National Natural Science Foundation of China(Grants No.52250005,21875271,21707147,11604346,21671195,and 51872302)+3 种基金the Key R&D Projects of Zhejiang Province No.2022C01236the Zhejiang Province Key Research and Development Program(No.2019C01060)the project of the key technology for virtue reactors from NPICEntrepreneurship Program of Foshan National Hi-tech Industrial Development Zone.
文摘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.
基金The authors are grateful for the support from Khon Kaen University Scholarship for ASEAN and GMS Countries’Personnel of Academic Year and the National Research Council of Thailand(N42A650549).
文摘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.
基金Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2022R237)Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code:(22UQU4310373DSR30).
文摘Recently,Internet of Things(IoT)has been developed into a field of research and it purposes at linking many sensors enabling devices mostly to data collection and track applications.Wireless sensor network(WSN)is a vital element of IoT paradigm since its inception and has developed into one of the chosen platforms for deploying many smart city application regions such as disaster management,intelligent transportation,home automation,smart buildings,and other such IoT-based application.The routing approaches were extremely-utilized energy efficient approaches with an initial drive that is,for balancing the energy amongst sensor nodes.The clustering and routing procedures assumed that Non-Polynomial(NP)hard problems but bio-simulated approaches are utilized to a recognized time for resolving such problems.With this motivation,this paper presents a new blockchain with Enhanced Hunger Games Search based Route Planning(BCEHGS-RP)scheme for IoT assisted WSN.The presented BCEHGS-RP model majorly employs BC technology for secure communication in the IoT supportedWSN environment.In addition,an effective multihop route planning approach was designed by the use of EHGS technique.The proposed EHGS technique is derived from the concept of Hill Climbing strategy(HCS)and HGS algorithm.Moreover,a fitness function with two parameters namely residual energy(RE)and intercluster distance to elect optimal routes.The performance validation of the BCEHGS-RP model is experimented with under diverse number of nodes.Extensive experimental outcomes highlighted the better performance of the BCEHGS-RP technique on recent approaches.
文摘With recent advancements made in wireless communication techniques,wireless sensors have become an essential component in both data collection as well as tracking applications.Wireless Sensor Network(WSN)is an integral part of Internet of Things(IoT)and it encounters different kinds of security issues.Blockchain is designed as a game changer for highly secure and effective digital society.So,the current research paper focuses on the design of Metaheuristic-based Clustering with Routing Protocol for Blockchain-enabled WSN abbreviated as MCRP-BWSN.The proposed MCRP-BWSN technique aims at deriving a shared memory scheme using blockchain technology and determine the optimal paths to reach the destination in clustered WSN.In MCRP-BWSN technique,Chimp Optimization Algorithm(COA)-based clustering technique is designed to elect a proper set of Cluster Heads(CHs)and organize the selected clusters.In addition,Horse Optimization Algorithm(HOA)-based routing technique is also presented to optimally select the routes based onfitness function.Besides,HOA-based routing technique utilizes blockchain technology to avail the shared mem-ory among nodes in the network.Sensor nodes are treated as coins whereas the ownership handles the sensor nodes and Base Station(BS).In order to validate the enhanced performance of the proposed MCRP-BWSN technique,a wide range of simulations was conducted and the results were examined under different measures.Based on the performance exhibited in simulation outcomes,the pro-posed MCRP-BWSN technique has been established as a promising candidate over other existing techniques.
基金supported by National Natural Science Foundation of China under Grant 62073330.The auther J.T.received the grant。
文摘No optimization algorithm can obtain satisfactory results in all optimization tasks.Thus,it is an effective way to deal with the problem by an ensemble ofmultiple algorithms.This paper proposes an ensemble of population-based metaheuristics(EPM)to solve single-objective optimization problems.The design of the EPM framework includes three stages:the initial stage,the update stage,and the final stage.The framework applies the transformation of the real and virtual population to balance the problem of exploration and exploitation at the population level and uses an elite strategy to communicate among virtual populations.The experiment tested two benchmark function sets with fivemetaheuristic algorithms and four ensemble algorithms.The ensemble algorithms are generally superior to the original algorithms by Friedman’s average ranking andWilcoxon signed ranking test results,demonstrating the ensemble framework’s effect.By solving the iterative curves of different test functions,we can see that the ensemble algorithms have faster iterative optimization speed and better optimization results.The ensemble algorithms cannot fall into local optimumby virtual populations distribution map of several stages.The ensemble framework performs well from the effects of solving two practical engineering problems.Some results of ensemble algorithms are superior to those of metaheuristic algorithms not included in the ensemble framework,further demonstrating the ensemble method’s potential and superiority.
文摘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.
文摘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.
