An Opposition-Based Learning-Based Search Mechanism for Flying Foxes Optimization Algorithm

The flying foxes optimization(FFO)algorithm,as a newly introduced metaheuristic algorithm,is inspired by the survival tactics of flying foxes in heat wave environments.FFO preferentially selects the best-performing individuals.This tendency will cause the newly generated solution to remain closely tied to the candidate optimal in the search area.To address this issue,the paper introduces an opposition-based learning-based search mechanism for FFO algorithm(IFFO).Firstly,this paper introduces niching techniques to improve the survival list method,which not only focuses on the adaptability of individuals but also considers the population’s crowding degree to enhance the global search capability.Secondly,an initialization strategy of opposition-based learning is used to perturb the initial population and elevate its quality.Finally,to verify the superiority of the improved search mechanism,IFFO,FFO and the cutting-edge metaheuristic algorithms are compared and analyzed using a set of test functions.The results prove that compared with other algorithms,IFFO is characterized by its rapid convergence,precise results and robust stability.

Modified Elite Opposition-Based Artificial Hummingbird Algorithm for Designing FOPID Controlled Cruise Control System

Efficient speed controllers for dynamic driving tasks in autonomous vehicles are crucial for ensuring safety and reliability.This study proposes a novel approach for designing a fractional order proportional-integral-derivative(FOPID)controller that utilizes a modified elite opposition-based artificial hummingbird algorithm(m-AHA)for optimal parameter tuning.Our approach outperforms existing optimization techniques on benchmark functions,and we demonstrate its effectiveness in controlling cruise control systems with increased flexibility and precision.Our study contributes to the advancement of autonomous vehicle technology by introducing a novel and efficient method for FOPID controller design that can enhance the driving experience while ensuring safety and reliability.We highlight the significance of our findings by demonstrating how our approach can improve the performance,safety,and reliability of autonomous vehicles.This study’s contributions are particularly relevant in the context of the growing demand for autonomous vehicles and the need for advanced control techniques to ensure their safe operation.Our research provides a promising avenue for further research and development in this area.

A Spider Monkey Optimization Algorithm Combining Opposition-Based Learning and Orthogonal Experimental Design

As a new bionic algorithm,Spider Monkey Optimization(SMO)has been widely used in various complex optimization problems in recent years.However,the new space exploration power of SMO is limited and the diversity of the population in SMO is not abundant.Thus,this paper focuses on how to reconstruct SMO to improve its performance,and a novel spider monkey optimization algorithm with opposition-based learning and orthogonal experimental design(SMO^(3))is developed.A position updatingmethod based on the historical optimal domain and particle swarmfor Local Leader Phase(LLP)andGlobal Leader Phase(GLP)is presented to improve the diversity of the population of SMO.Moreover,an opposition-based learning strategy based on self-extremum is proposed to avoid suffering from premature convergence and getting stuck at locally optimal values.Also,a local worst individual elimination method based on orthogonal experimental design is used for helping the SMO algorithm eliminate the poor individuals in time.Furthermore,an extended SMO^(3)named CSMO^(3)is investigated to deal with constrained optimization problems.The proposed algorithm is applied to both unconstrained and constrained functions which include the CEC2006 benchmark set and three engineering problems.Experimental results show that the performance of the proposed algorithm is better than three well-known SMO algorithms and other evolutionary algorithms in unconstrained and constrained problems.

An Improved Gorilla Troops Optimizer Based on Lens Opposition-Based Learning and Adaptive β-Hill Climbing for Global Optimization

Gorilla troops optimizer(GTO)is a newly developed meta-heuristic algorithm,which is inspired by the collective lifestyle and social intelligence of gorillas.Similar to othermetaheuristics,the convergence accuracy and stability of GTOwill deterioratewhen the optimization problems to be solved becomemore complex and flexible.To overcome these defects and achieve better performance,this paper proposes an improved gorilla troops optimizer(IGTO).First,Circle chaotic mapping is introduced to initialize the positions of gorillas,which facilitates the population diversity and establishes a good foundation for global search.Then,in order to avoid getting trapped in the local optimum,the lens opposition-based learning mechanism is adopted to expand the search ranges.Besides,a novel local search-based algorithm,namely adaptiveβ-hill climbing,is amalgamated with GTO to increase the final solution precision.Attributed to three improvements,the exploration and exploitation capabilities of the basic GTOare greatly enhanced.The performance of the proposed algorithm is comprehensively evaluated and analyzed on 19 classical benchmark functions.The numerical and statistical results demonstrate that IGTO can provide better solution quality,local optimumavoidance,and robustness compared with the basic GTOand five other wellknown algorithms.Moreover,the applicability of IGTOis further proved through resolving four engineering design problems and training multilayer perceptron.The experimental results suggest that IGTO exhibits remarkable competitive performance and promising prospects in real-world tasks.

Opposition-based differential evolution for hydrothermal power system

This paper presents opposition-based differential evolution to determine the optimal hourly schedule of power generation in a hydrothermal system.Differential evolution(DE)is a population-based stochastic parallel search evolutionary algorithm.Opposition-based differential evolution has been used here to improve the effectiveness and quality of the solution.The proposed opposition-based differential evolution(ODE)employs opposition-based learning(OBL)for population initialization and also for generation jumping.The effectiveness of the proposed method has been verified on two test problems,two fixed head hydrothermal test systems and three hydrothermal multi-reservoir cascaded hydroelectric test systems having prohibited operating zones and thermal units with valve point loading.The results of the proposed approach are compared with those obtained by other evolutionary methods.It is found that the proposed opposition-based differential evolution based approach is able to provide better solution.

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.

Support vector regression-based operational effectiveness evaluation approach to reconnaissance satellite system

As one of the most important part of weapon system of systems(WSoS),quantitative evaluation of reconnaissance satellite system(RSS)is indispensable during its construction and application.Aiming at the problem of nonlinear effectiveness evaluation under small sample conditions,we propose an evaluation method based on support vector regression(SVR)to effectively address the defects of traditional methods.Considering the performance of SVR is influenced by the penalty factor,kernel type,and other parameters deeply,the improved grey wolf optimizer(IGWO)is employed for parameter optimization.In the proposed IGWO algorithm,the opposition-based learning strategy is adopted to increase the probability of avoiding the local optima,the mutation operator is used to escape from premature convergence and differential convergence factors are applied to increase the rate of convergence.Numerical experiments of 14 test functions validate the applicability of IGWO algorithm dealing with global optimization.The index system and evaluation method are constructed based on the characteristics of RSS.To validate the proposed IGWO-SVR evaluation method,eight benchmark data sets and combat simulation are employed to estimate the evaluation accuracy,convergence performance and computational complexity.According to the experimental results,the proposed method outperforms several prediction based evaluation methods,verifies the superiority and effectiveness in RSS operational effectiveness evaluation.

Enhanced Harris Hawks Optimization Integrated with Coot Bird Optimization for Solving Continuous Numerical Optimization Problems

Harris Hawks Optimization(HHO)is a novel meta-heuristic algorithm that imitates the predation characteristics of Harris Hawk and combines Lévy flight to solve complex multidimensional problems.Nevertheless,the basic HHO algorithm still has certain limitations,including the tendency to fall into the local optima and poor convergence accuracy.Coot Bird Optimization(CBO)is another new swarm-based optimization algorithm.CBO originates from the regular and irregular motion of a bird called Coot on the water’s surface.Although the framework of CBO is slightly complicated,it has outstanding exploration potential and excellent capability to avoid falling into local optimal solutions.This paper proposes a novel enhanced hybrid algorithm based on the basic HHO and CBO named Enhanced Harris Hawks Optimization Integrated with Coot Bird Optimization(EHHOCBO).EHHOCBO can provide higher-quality solutions for numerical optimization problems.It first embeds the leadership mechanism of CBO into the population initialization process of HHO.This way can take full advantage of the valuable solution information to provide a good foundation for the global search of the hybrid algorithm.Secondly,the Ensemble Mutation Strategy(EMS)is introduced to generate the mutant candidate positions for consideration,further improving the hybrid algorithm’s exploration trend and population diversity.To further reduce the likelihood of falling into the local optima and speed up the convergence,Refracted Opposition-Based Learning(ROBL)is adopted to update the current optimal solution in the swarm.Using 23 classical benchmark functions and the IEEE CEC2017 test suite,the performance of the proposed EHHOCBO is comprehensively evaluated and compared with eight other basic meta-heuristic algorithms and six improved variants.Experimental results show that EHHOCBO can achieve better solution accuracy,faster convergence speed,and a more robust ability to jump out of local optima than other advanced optimizers in most test cases.Finally,EHHOCBOis applied to address four engineering design problems.Our findings indicate that the proposed method also provides satisfactory performance regarding the convergence accuracy of the optimal global solution.

An Improved Whale Optimization Algorithm for Global Optimization and Realized Volatility Prediction

The original whale optimization algorithm(WOA)has a low initial population quality and tends to converge to local optimal solutions.To address these challenges,this paper introduces an improved whale optimization algorithm called OLCHWOA,incorporating a chaos mechanism and an opposition-based learning strategy.This algorithm introduces chaotic initialization and opposition-based initialization operators during the population initialization phase,thereby enhancing the quality of the initial whale population.Additionally,including an elite opposition-based learning operator significantly improves the algorithm’s global search capabilities during iterations.The work and contributions of this paper are primarily reflected in two aspects.Firstly,an improved whale algorithm with enhanced development capabilities and a wide range of application scenarios is proposed.Secondly,the proposed OLCHWOA is used to optimize the hyperparameters of the Long Short-Term Memory(LSTM)networks.Subsequently,a prediction model for Realized Volatility(RV)based on OLCHWOA-LSTM is proposed to optimize hyperparameters automatically.To evaluate the performance of OLCHWOA,a series of comparative experiments were conducted using a variety of advanced algorithms.These experiments included 38 standard test functions from CEC2013 and CEC2019 and three constrained engineering design problems.The experimental results show that OLCHWOA ranks first in accuracy and stability under the same maximum fitness function calls budget.Additionally,the China Securities Index 300(CSI 300)dataset is used to evaluate the effectiveness of the proposed OLCHWOA-LSTM model in predicting RV.The comparison results with the other eight models show that the proposed model has the highest accuracy and goodness of fit in predicting RV.This further confirms that OLCHWOA effectively addresses real-world optimization problems.

Multi-Strategy Boosted Spider Monkey Optimization Algorithm for Feature Selection

To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial population is generated by a refracted opposition-based learning strategy to enhance diversity and ergodicity.Second,this paper introduces a non-linear adaptive dynamic weight factor to improve convergence efficiency.Then,using the crisscross strategy,using the horizontal crossover to enhance the global search and vertical crossover to keep the diversity of the population to avoid being trapped in the local optimum.At last,we adopt a Gauss-Cauchy mutation strategy to improve the stability of the algorithm by mutation of the optimal individuals.Therefore,the application of ISMO is validated by ten benchmark functions and feature selection.It is proved that the proposed method can resolve the problem of feature selection.

Hybrid heuristic algorithm for multi-objective scheduling problem

This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-objective flexible job-shop scheduling problems(MOFJSPs) to minimize makespan, total machine workload and critical machine workload. An initialization program embedded in opposition-based learning(OBL) is developed for enabling the individuals to scatter in a well-distributed manner in the initial harmony memory(HM). In addition, the recursive halving technique based on opposite number is employed for shrinking the neighbourhood space in the searching phase of the OGHS. From a practice-related standpoint, a type of dual vector code technique is introduced for allowing the OGHS algorithm to adapt the discrete nature of the MOFJSP. Two practical techniques, namely Pareto optimality and technique for order preference by similarity to an ideal solution(TOPSIS), are implemented for solving the MOFJSP.Furthermore, the algorithm performance is tested by using different strategies, including OBL and recursive halving, and the OGHS is compared with existing algorithms in the latest studies.Experimental results on representative examples validate the performance of the proposed algorithm for solving the MOFJSP.

Removal of Ocular Artifacts from Electroencephalo-Graph by Improving Variational Mode Decomposition

Ocular artifacts in Electroencephalography(EEG)recordings lead to inaccurate results in signal analysis and process.Variational Mode Decomposition(VMD)is an adaptive and completely nonrecursive signal processing method.There are two parameters in VMD that have a great influence on the result of signal decomposition.Thus,this paper studies a signal decomposition by improving VMD based on squirrel search algorithm(SSA).It’s improved with abilities of global optimal guidance and opposition based learning.The original seasonal monitoring condition in SSA is modified.The feedback of whether the optimal solution is successfully updated is used to establish new seasonal monitoring conditions.Opposition-based learning is introduced to reposition the position of the population in this stage.It is applied to optimize the important parameters of VMD.GOSSA-VMD model is established to remove ocular artifacts from EEG recording.We have verified the effectiveness of our proposal in a public dataset compared with other methods.The proposed method improves the SNR of the dataset from-2.03 to 2.30.

Strengthened Initialization of Adaptive Cross-Generation Differential Evolution

Adaptive Cross-Generation Differential Evolution(ACGDE)is a recently-introduced algorithm for solving multiobjective problems with remarkable performance compared to other evolutionary algorithms(EAs).However,its convergence and diversity are not satisfactory compared with the latest algorithms.In order to adapt to the current environment,ACGDE requires improvements in many aspects,such as its initialization and mutant operator.In this paper,an enhanced version is proposed,namely SIACGDE.It incorporates a strengthened initialization strategy and optimized parameters in contrast to its predecessor.These improvements make the direction of crossgeneration mutation more clearly and the ability of searching more efficiently.The experiments show that the new algorithm has better diversity and improves convergence to a certain extent.At the same time,SIACGDE outperforms other state-of-the-art algorithms on four metrics of 24 test problems.

An Improved Harris Hawks Optimization Algorithm with Multi-strategy for Community Detection in Social Network

The purpose of community detection in complex networks is to identify the structural location of nodes. Complex network methods are usually graphical, with graph nodes representing objects and edges representing connections between things. Communities are node clusters with many internal links but minimal intergroup connections. Although community detection has attracted much attention in social media research, most face functional weaknesses because the structure of society is unclear or the characteristics of nodes in society are not the same. Also, many existing algorithms have complex and costly calculations. This paper proposes different Harris Hawk Optimization (HHO) algorithm methods (such as Improved HHO Opposition-Based Learning(OBL) (IHHOOBL), Improved HHO Lévy Flight (IHHOLF), and Improved HHO Chaotic Map (IHHOCM)) were designed to balance exploitation and exploration in this algorithm for community detection in the social network. The proposed methods are evaluated on 12 different datasets based on NMI and modularity criteria. The findings reveal that the IHHOOBL method has better detection accuracy than IHHOLF and IHHOCM. Also, to offer the efficiency of the , state-of-the-art algorithms have been used as comparisons. The improvement percentage of IHHOOBL compared to the state-of-the-art algorithm is about 7.18%.

A Modified Oppositional Chaotic Local Search Strategy Based Aquila Optimizer to Design an Effective Controller for Vehicle Cruise Control System

In this work,we propose a real proportional-integral-derivative plus second-order derivative(PIDD2)controller as an efficient controller for vehicle cruise control systems to address the challenging issues related to efficient operation.In this regard,this paper is the first report in the literature demonstrating the implementation of a real PIDD2 controller for controlling the respective system.We construct a novel and efficient metaheuristic algorithm by improving the performance of the Aquila Optimizer via chaotic local search and modified opposition-based learning strategies and use it as an excellently performing tuning mechanism.We also propose a simple yet effective objective function to increase the performance of the proposed algorithm(CmOBL-AO)to adjust the real PIDD2 controller's parameters effectively.We show the CmOBL-AO algorithm to perform better than the differential evolution algorithm,gravitational search algorithm,African vultures optimization,and the Aquila Optimizer using well-known unimodal,multimodal benchmark functions.CEC2019 test suite is also used to perform ablation experiments to reveal the separate contributions of chaotic local search and modified opposition-based learning strategies to the CmOBL-AO algorithm.For the vehicle cruise control system,we confirm the more excellent performance of the proposed method against particle swarm,gray wolf,salp swarm,and original Aquila optimizers using statistical,Wilcoxon signed-rank,time response,robustness,and disturbance rejection analyses.We also use fourteen reported methods in the literature for the vehicle cruise control system to further verify the more promising performance of the CmOBL-AO-based real PIDD2 controller from a wider perspective.The excellent performance of the proposed method is also illustrated through different quality indicators and different operating speeds.Lastly,we also demonstrate the good performing capability of the CmOBL-AO algorithm for real traffic cases.We show the CmOBL-AO-based real PIDD2 controller as the most efficient method to control a vehicle cruise control system.

Hybrid Modified Chimp Optimization Algorithm and Reinforcement Learning for Global Numeric Optimization

Chimp Optimization Algorithm(ChOA)is one of the most efficient recent optimization algorithms,which proved its ability to deal with different problems in various do-mains.However,ChOA suffers from the weakness of the local search technique which leads to a loss of diversity,getting stuck in a local minimum,and procuring premature convergence.In response to these defects,this paper proposes an improved ChOA algorithm based on using Opposition-based learning(OBL)to enhance the choice of better solutions,written as OChOA.Then,utilizing Reinforcement Learning(RL)to improve the local research technique of OChOA,called RLOChOA.This way effectively avoids the algorithm falling into local optimum.The performance of the proposed RLOChOA algorithm is evaluated using the Friedman rank test on a set of CEC 2015 and CEC 2017 benchmark functions problems and a set of CEC 2011 real-world problems.Numerical results and statistical experiments show that RLOChOA provides better solution quality,convergence accuracy and stability compared with other state-of-the-art algorithms.

Improved sparrow search algorithm for RFID network planning

To solve the problem that the performance of the coverage,interference rate,load balance andweak power in the radio frequency identification(RFID)network planning.This paper proposes an elite opposition-based learning and Lévy flight sparrow search algorithm(SSA),which is named elite opposition-based learning and Levy flight SSA(ELSSA).First,the algorithm initializes the population by an elite opposed-based learning strategy to enhance the diversity of the population.Second,Lévy flight is introduced into the scrounger’s position update formula to solve the situation that the algorithm falls into the local optimal solution.It has a probability that the current position is changed by Lévy flight.This method can jump out of the local optimal solution.In the end,the proposed method is compared with particle swarm optimization(PSO)algorithm,grey wolf optimzer(GWO)algorithm and SSA in the multiple simulation tests.The simulated results showed that,under the same number of readers,the average fitness of the ELSSA is improved respectively by 3.36%,5.67%and 18.45%.By setting the different number of readers,ELSSA uses fewer readers than other algorithms.The conclusion shows that the proposed method can ensure a satisfying coverage by using fewer readers and achieving higher comprehensive performance.

BEESO:Multi-strategy Boosted Snake-Inspired Optimizer for Engineering Applications

This paper presents an efficient enhanced snake optimizer termed BEESO for global optimization and engineering applications.As a newly mooted meta-heuristic algorithm,snake optimizer(SO)mathematically models the mating characteristics of snakes to find the optimal solution.SO has a simple structure and offers a delicate balance between exploitation and exploration.However,it also has some shortcomings to be improved.The proposed BEESO consequently aims to lighten the issues of lack of population diversity,convergence slowness,and the tendency to be stuck in local optima in SO.The presentation of Bi-Directional Search(BDS)is to approach the global optimal value along the direction guided by the best and the worst individuals,which makes the convergence speed faster.The increase in population diversity in BEESO benefits from Modified Evolutionary Population Dynamics(MEPD),and the replacement of poorer quality individuals improves population quality.The Elite Opposition-Based Learning(EOBL)provides improved local exploitation ability of BEESO by utilizing solid solutions with good performance.The performance of BEESO is illustrated by comparing its experimental results with several algorithms on benchmark functions and engineering designs.Additionally,the results of the experiment are analyzed again from a statistical point of view using the Friedman and Wilcoxon rank sum tests.The findings show that these introduced strategies provide some improvements in the performance of SO,and the accuracy and stability of the optimization results provided by the proposed BEESO are competitive among all algorithms.To conclude,the proposed BEESO offers a good alternative to solving optimization issues.

Modified aquila optimizer for forecasting oil production

Oil production estimation plays a critical role in economic plans for local governments and organizations.Therefore,many studies applied different Artificial Intelligence(AI)based meth-ods to estimate oil production in different countries.The Adaptive Neuro-Fuzzy Inference System(ANFIS)is a well-known model that has been successfully employed in various applica-tions,including time-series forecasting.However,the ANFIS model faces critical shortcomings in its parameters during the configuration process.From this point,this paper works to solve the drawbacks of the ANFIS by optimizing ANFIS parameters using a modified Aquila Optimizer(AO)with the Opposition-Based Learning(OBL)technique.The main idea of the developed model,AOOBL-ANFIS,is to enhance the search process of the AO and use the AOOBL to boost the performance of the ANFIS.The proposed model is evaluated using real-world oil produc-tion datasets collected from different oilfields using several performance metrics,including Root Mean Square Error(RMSE),Mean Absolute Error(MAE),coefficient of determination(R2),Standard Deviation(Std),and computational time.Moreover,the AOOBL-ANFIS model is compared to several modified ANFIS models include Particle Swarm Optimization(PSO)-ANFIS,Grey Wolf Optimizer(GWO)-ANFIS,Sine Cosine Algorithm(SCA)-ANFIS,Slime Mold Algorithm(SMA)-ANFIS,and Genetic Algorithm(GA)-ANFIS,respectively.Additionally,it is compared to well-known time series forecasting methods,namely,Autoregressive Integrated Moving Average(ARIMA),Long Short-Term Memory(LSTM),Seasonal Autoregressive Integrated Moving Average(SARIMA),and Neural Network(NN).The outcomes verified the high performance of the AOOBL-ANFIS,which outperformed the classic ANFIS model and the compared models.

Generalized Oppositional Moth Flame Optimization with Crossover Strategy:An Approach for Medical Diagnosis

In the original Moth-Flame Optimization(MFO),the search behavior of the moth depends on the corresponding flame and the interaction between the moth and its corresponding flame,so it will get stuck in the local optimum easily when facing the multi-dimensional and high-dimensional optimization problems.Therefore,in this work,a generalized oppositional MFO with crossover strategy,named GCMFO,is presented to overcome the mentioned defects.In the proposed GCMFO,GOBL is employed to increase the population diversity and expand the search range in the initialization and iteration jump phase based on the jump rate;crisscross search(CC)is adopted to promote the exploitation and/or exploration ability of MFO.The proposed algorithm’s performance is estimated by organizing a series of experiments;firstly,the CEC2017 benchmark set is adopted to evaluate the performance of GCMFO in tackling high-dimensional and multimodal problems.Secondly,GCMFO is applied to handle multilevel thresholding image segmentation problems.At last,GCMFO is integrated into kernel extreme learning machine classifier to deal with three medical diagnosis cases,including the appendicitis diagnosis,overweight statuses diagnosis,and thyroid cancer diagnosis.Experimental results and discussions show that the proposed approach outperforms the original MFO and other state-of-the-art algorithms on both convergence speed and accuracy.It also indicates that the presented GCMFO has a promising potential for application.