A Hybrid Barnacles Mating Optimizer Algorithm With Support Vector Machines for Gene Selection of Microarray Cancer Classification

Several optimization problems from various types of applications have been efficiently resolved using available meta-heuristic algorithms such as Particle Swarm Optimization and Genetic Algorithm. Recently, many meta-heuristic optimization techniques have been extensively reported in the literature. Nevertheless, there is still room for new optimization techniques and strategies since, according to the literature, there is no meta-heuristic optimization algorithm that may be considered as the best choice to cope with all modern optimization problems. This paper introduces a novel meta-heuristic optimization algorithm named Dynamic Group-based Optimization Algorithm (DGCO). The proposed algorithm is inspired by the cooperative behavior adopted by swarm individuals to achieve their global goals. DGCO has been validated and tested against twenty-three mathematical optimization problems, and the results have been verified by a comparative study with respect to state-of-the-art optimization algorithms that are already available. The results have shown the high exploration capabilities of DGCO as well as its ability to avoid local optima. Moreover, the performance of DGCO has also been verified against five constrained engineering design problems. The results demonstrate the competitive performance and capabilities of DGCO with respect to well-known state-of-the-art meta-heuristic optimization algorithms. Finally, a sensitivity analysis is performed to study the effect of different parameters on the performance of the DGCO algorithm.

With the development of science and technology, many optimization problems in real life have developed into high-dimensional optimization problems. The meta-heuristic optimization algorithm is regarded as an effective method to solve high-dimensional optimization problems. However, considering that traditional meta-heuristic optimization algorithms generally have problems such as low solution accuracy and slow convergence speed when solving high-dimensional optimization problems, an adaptive dual-population collaborative chicken swarm optimization (ADPCCSO) algorithm is proposed in this paper, which provides a new idea for solving high-dimensional optimization problems. First, in order to balance the algorithm’s search abilities in terms of breadth and depth, the value of parameter G is given by an adaptive dynamic adjustment method. Second, in this paper, a foraging-behavior-improvement strategy is utilized to improve the algorithm’s solution accuracy and depth-optimization ability. Third, the artificial fish swarm algorithm (AFSA) is introduced to construct a dual-population collaborative optimization strategy based on chicken swarms and artificial fish swarms, so as to improve the algorithm’s ability to jump out of local extrema. The simulation experiments on the 17 benchmark functions preliminarily show that the ADPCCSO algorithm is superior to some swarm-intelligence algorithms such as the artificial fish swarm algorithm (AFSA), the artificial bee colony (ABC) algorithm, and the particle swarm optimization (PSO) algorithm in terms of solution accuracy and convergence performance. In addition, the APDCCSO algorithm is also utilized in the parameter estimation problem of the Richards model to further verify its performance.

Hippopotamus algorithm for optimal sizing of hybrid renewable energy system

Despite the considerable efforts that are done for Microarray gene expression profile, biomarker discovery or gene selection process remains a complex challenge for biologists and computer scientists. This article presented an Artificial Bee Colony (ABC) based approach for accurate classification of cancer microarray data using support vector machine (SVM) as a classifier. The approach is able to deal with the high dimensionality of the microarray data. According to literature for microarray data analysis, up to our knowledge, this is the first attempt to apply Artificial Bee Colony based algorithm as gene selection method for cancer classification problem using Microarray gene expression profile. Comparing with other algorithms that are proposed in the literature, we can conclude that our proposed algorithm (ABC-SVM) obtains promising results for gene selection and cancer classification problems.

Procedural Content Generation (PCG) has emerged as a powerful approach for automating game content creation, offering significant benefits in terms of cost reduction and time efficiency compared to traditional game design and development processes (Zhang, Zhang, & Huang, 2022). While Genetic Algorithms (GAs) have been widely used in PCG, alternative metaheuristic algorithms such as Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) have demonstrated their effectiveness in delivering high-quality solutions and efficient optimization capabilities across different problem domains (Amato, 2017). However, their application in PCG remains limited. I aim to evaluate the performance of PSO and ABC in map layout generation, challenging the conventional use of GAs. By comparing three metaheuristic algorithms (GA, ABC, and PSO) I seek to assess the effectiveness of these approaches in generating game levels and identify any obvious differences in their performance characteristics. Comprehensive experiments are conducted, applying GA, ABC, and PSO to a map layout generation. Metrics like convergence speed and content quality are used to evaluate the generated game content. My findings reveal that both ABC and PSO demonstrate advantages over traditional GA implementations when generating game levels, indicating their potential for enhancing PCG. In this presentation, I will share the results of comparing three metaheuristic algorithms (GA, PSO, and ABC) in map layout generation for game levels, emphasizing the potential benefits of leveraging diverse algorithmic approaches to create more captivating and immersive game worlds. Also, I will conclude with a call for further research in this area to expose new possibilities in content generation. By considering varied metaheuristic approaches, game developers can improve content generation techniques and create more captivating and interactive player experiences.

Cancer classification using a novel gene selection approach by means of shuffling based on data clustering with optimization

A Metaheuristic Optimization Algorithm for energy efficiency in Digital Twins

Hyperspectral remote sensing imagery, due to its rich source of spectral information, provides an efficient tool for land cover classifications in complex geographical areas. However, the high-dimensional space of this imagery poses two important challenges in the classification process: the Hughes phenomena and the existence of relevant and redundant features. The robustness of Support Vector Machines (SVM) in high-dimensional space makes them an efficient tool for classifying hyperspectral imagery. However, optimum SVM parameter determination and optimum feature selection are the two optimization issues that strongly effect SVM performance. Traditional optimization algorithms can discover optimum solutions in a limited search space with one local optimum. Nevertheless, in high-dimensional space traditional optimization algorithms usually get trapped in a local optimum, therefore it is necessary to apply meta-heuristic optimization algorithms to obtain near-global optimum solutions. This study evaluates the potential of Ant Colony Optimization (ACO) for determining SVM parameters and selecting features. Results obtained from AVIRIS and ROSIS hyperspectral datasets demonstrate the superior performance of SVM, achieved by simultaneously optimizing SVM parameters and subsets of the input feature. For comparison, the evaluation is also performed by applying it to other meta-heuristic optimization algorithms such as simulated annealing, tabu search, and genetic algorithm. The results demonstrate a better performance of the ACO-based algorithm in regards to improving the classification accuracy and decreasing the size of selected feature subsets.

Inspired by the intelligent foraging behaviour of honeybees swarm, Artificial Bee Colony (ABC) has been introduced by Karagoba in 2005. ABC algorithm has exhibited superior performance compared to other algorithms such as Genetic Algorithm (GA), Differential Evolution (DE) and Particle Swarm Optimization (PSO) algorithms. Despite its outstanding performance, ABC suffers from slow convergence rate and premature convergence. Hence, researchers have proposed various ABC variants but none among the variants could have averted both problems simultaneously. Hence, a new ABC algorithm has been proposed which aims to overcome the limitations. The proposed algorithm focuses on enhancing average fitness of population by mutating poor possible solutions around the fittest solution. The presented results show that the proposed algorithm is capable to avert local optima traps at faster convergence speed.

In this paper, the bat-inspired algorithm (BA) is tolerated to gene selection for cancer classification using microarray datasets. Microarray data consists of irrelevant, redundant, and noisy genes. Gene selection problem is tackled by determining the most informative genes taken from microarray data to accurately diagnose the cancer disease. Gene selection problem is widely solved by optimisation algorithms. BA is a recent swarm-based algorithm, which imitates the echolocation system of bat individuals. It has been successfully applied to several optimisation problems. Gene selection is tackled by combining two stages, namely, filter stage, which uses Minimum Redundancy Maximum Relevancy (MRMR) method; and wrapper stage, which uses BA and SVM. To test the accuracy performance of the proposed method, ten microarray datasets were used. For comparative evaluation, the proposed method was compared with popular gene selection methods. The proposed method achieves comparable results of some datasets and produced new results for one dataset.

Over the years, Metaheuristic algorithms have proven significant efficacy in handling None- Deterministic polynomial hard (NP-hard) combinatorial optimization problems, mainly the Traveling Salesman Problem (TSP) which has been used to evaluate and test many metaheuristics algorithms such as Ant Colony optimizations. This paper contributes a new optimization algorithm to the famous-family of swarm and evolutionary techniques named Scuba Diver Optimization Algorithm (SDOA) which is a novel population-based metaheuristic optimization algorithm inspired by the behavioural and physiological dynamics of scuba divers in the open water environments. SDOA simulates main diving factors including (depth, tank pressure/oxygen, bottom time, and ascent strategies) for keeping a balance between explorations and exploitations during the search process. SDOA novelty appears in its adaptive control of solution diversity using pressure and oxygen level thresholds, enabling robust avoidance of local optima and faster convergence. The SDOA algorithm was evaluated on a range of TSP instances from the TSPLIB library, which were categorized into three groups: Group 1, comprising instances with 1–99 cities; Group 2, including instances with 100–999 cities; and Group 3, consisting of large-scale instances with 1000 or more cities. And the results of SDOA is compared with established metaheuristics algorithms such as Ant Colony Optimization, Artificial Bee Colony, and Genetic Algorithm. The study results showing that SDOA consistently produces shorter (near optimal) tour lengths with significantly minimum computational time in larger problem sizes (Group 3). The proposed algorithm also demonstrates better scalability and stability in different initialization and population sizes. Future directions include adapting SDOA for solving other optimization problems including multi-objective or dynamic optimization contexts.

This paper presents compared performances of three metaheuristic algorithms in determining the cost of hybrid renewable energy system. Using genetic algorithm (GA), particle swarm optimization (PSO), and artificial bee colony (ABC), the best affordable sizes of solar photovoltaic array, battery bank, and a minimum-rated diesel generator that could be hybridized to meet the demand of a community in Southwest Nigeria were determined. Load profile, solar radiation, and temperature data were employed as required inputs, and the parameters of the algorithms were properly set to ensure the best result. Bonferroni– Holm method was deployed to ascertain the statistical significance among the algorithms. It was found that ABC produced the best configuration comprising 427 numbers of solar photovoltaic panels, 19 battery units, and 163.2 kW-rated diesel generator. With this, a total annualized cost of $167 284 and 0.2443 estimated cost of energy were obtained. These were the lowest when compared with PSO and GA. The t-test between PSO and ABC are both 5.83 × 10−10 < 0.01666667, between ABC and GA are 6.09 × 10−6 0.01666667 and 9.13 × 10−1 > 0.05. PSO/ABC and ABC/GA groups are clarified significant, while GA/PSO group is insignificant; post hoc test reveals that ABC produced the best result. Hence, a reliable and sustainable power supply at a reduced cost is guaranteed for the community. Cite this article as: T.O. Ajewole, O. Oladepo, K.A. Hassan, A.A. Olawuyi, O. Opeyemi, Comparative study of the performances of three metaheuristic algorithms in sizing hybrid-source power system. Turk J Electr Power Energy Syst, 2022; 2(2), 134-146.

The multi-objective portfolio optimization is regarded as an multi-objective optimization problem which is complicated and hard to find a satisfactory solution in a limited time. It is more complex and difficult to use the conventional method to solve this problem. In this paper, we first establish a mean-CVaR-entropy model with transaction costs and investment weight restrictions, and then propose a Multi-objective Optimization Algorithm for BeetleSearch(MOBSO), a meta-heuristic optimization algorithm, and a variant of Beetle Antennae Search (BAS) algorithm, which is applied into portfolio optimization to solve this constraint multi-objective optimization problem. Finally, we use the 20 stocksfrom January 2017 to December 2021 in the US stock market to do case studyand compare the results with other meta-heuristic optimization algorithms. It shows that the MOBSO outperforms swarm algorithms such as the particle swarm optimization (PSO) and the genetic algorithm(GA). KeywordsMulti-objective portfolio optimizationBeetle Antennae Search (BAS)Particle Swarm Optimization (PSO)Meta-heuristic optimizationFinance problem

This work deals with metaheuristic optimization algorithms to derive the best parameters for the Gaussian Adaptive PID controller. This controller represents a multimodal problem, where several distinct solutions can achieve similar best performances, and metaheuristics optimization algorithms can behave differently during the optimization process. Finding the correct proportionality between the parameters is an arduous task that often does not have an algebraic solution. The Gaussian functions of each control action have three parameters, resulting in a total of nine parameters to be defined. In this work, we investigate three bio-inspired optimization methods dealing with this problem: Particle Swarm Optimization (PSO), the Artificial Bee Colony (ABC) algorithm, and the Whale Optimization Algorithm (WOA). The computational results considering the Buck converter with a resistive and a nonlinear load as a case study demonstrated that the methods were capable of solving the task. The results are presented and compared, and PSO achieved the best results.

Operational framework for recent advances in backtracking search optimisation algorithm: A systematic review and performance evaluation