A Self-adaptive Multipeak Artificial Immune Genetic Algorithm

Genetic algorithm is a global probability search algorithm developed by simulating the biological natural selection and genetic evolution mechanism and it has excellent global search ability, however, in practical applications, premature convergence occurs easily in the genetic algorithm. This paper proposes an self-adaptive multi-peak immune genetic algorithm (SMIGA) and this algorithm integrates immunity thought in the biology immune system into the evolutionary process of genetic algorithm, uses self-adaptive dynamic vaccination and provides a downtime criterion, the selection strategy of immune vaccine and the construction method of immune operators so as to promote the population develop towards the optimization trend and suppress the degeneracy phenomenon in the optimization by using the feature information in a selective and purposive manner. The simulation experiment shows that the method of this paper can better solve the optimization problem of multi-peak functions, realize global optimum search, overcome the prematurity problem of the antibody population and improve the effectiveness and robustness of optimization

Leo: Lagrange Elementary Optimization

Global optimization problems are frequently solved using the practical and efficient method of evolutionary sophistication. But as the original problem becomes more complex, so does its efficacy and expandability. Thus, the purpose of this research is to introduce the Lagrange Elementary Optimization (Leo) as an evolutionary method, which is self-adaptive inspired by the remarkable accuracy of vaccinations using the albumin quotient of human blood. They develop intelligent agents using their fitness function value after gene crossing. These genes direct the search agents during both exploration and exploitation. The main objective of the Leo algorithm is presented in this paper along with the inspiration and motivation for the concept. To demonstrate its precision, the proposed algorithm is validated against a variety of test functions, including 19 traditional benchmark functions and the CECC06 2019 test functions. The results of Leo for 19 classic benchmark test functions are evaluated against DA, PSO, and GA separately, and then two other recent algorithms such as FDO and LPB are also included in the evaluation. In addition, the Leo is tested by ten functions on CECC06 2019 with DA, WOA, SSA, FDO, LPB, and FOX algorithms distinctly. The cumulative outcomes demonstrate Leo's capacity to increase the starting population and move toward the global optimum. Different standard measurements are used to verify and prove the stability of Leo in both the exploration and exploitation phases. Moreover, Statistical analysis supports the findings results of the proposed research. Finally, novel applications in the real world are introduced to demonstrate the practicality of Leo.Comment: 28 page

A self-organizing weighted optimization based framework for large-scale multi-objective optimization

The solving of large-scale multi-objective optimization problem (LSMOP) has become a hot research topic in evolutionary computation. To better solve this problem, this paper proposes a self-organizing weighted optimization based framework, denoted S-WOF, for addressing LSMOPs. Compared to the original framework, there are two main improvements in our work. Firstly, S-WOF simplifies the evolutionary stage into one stage, in which the evaluating numbers of weighted based optimization and normal optimization approaches are adaptively adjusted based on the current evolutionary state. Specifically, regarding the evaluating number for weighted based optimization (i.e., t1), it is larger when the population is in the exploitation state, which aims to accelerate the convergence speed, while t1 is diminishing when the population is switching to the exploration state, in which more attentions are put on the diversity maintenance. On the other hand, regarding the evaluating number for original optimization (i.e., t2), which shows an opposite trend to t1, it is small during the exploitation stage but gradually increases later. In this way, a dynamic trade-off between convergence and diversity is achieved in S-WOF. Secondly, to further improve the search ability in the large-scale decision space, an efficient competitive swarm optimizer (CSO) is implemented in S-WOF, which shows efficiency for solving LSMOPs. Finally, the experimental results have validated the superiority of S-WOF over several state-of-the-art large-scale evolutionary algorithms

Investigating biocomplexity through the agent-based paradigm.

Capturing the dynamism that pervades biological systems requires a computational approach that can accommodate both the continuous features of the system environment as well as the flexible and heterogeneous nature of component interactions. This presents a serious challenge for the more traditional mathematical approaches that assume component homogeneity to relate system observables using mathematical equations. While the homogeneity condition does not lead to loss of accuracy while simulating various continua, it fails to offer detailed solutions when applied to systems with dynamically interacting heterogeneous components. As the functionality and architecture of most biological systems is a product of multi-faceted individual interactions at the sub-system level, continuum models rarely offer much beyond qualitative similarity. Agent-based modelling is a class of algorithmic computational approaches that rely on interactions between Turing-complete finite-state machines--or agents--to simulate, from the bottom-up, macroscopic properties of a system. In recognizing the heterogeneity condition, they offer suitable ontologies to the system components being modelled, thereby succeeding where their continuum counterparts tend to struggle. Furthermore, being inherently hierarchical, they are quite amenable to coupling with other computational paradigms. The integration of any agent-based framework with continuum models is arguably the most elegant and precise way of representing biological systems. Although in its nascence, agent-based modelling has been utilized to model biological complexity across a broad range of biological scales (from cells to societies). In this article, we explore the reasons that make agent-based modelling the most precise approach to model biological systems that tend to be non-linear and complex

A Proposed Framework to Improve Diagnosis of Covid-19 Based on Patient’s Symptoms using Feature Selection Optimization

Recently, an epidemic called COVID-19 appeared, and it was one of the largest epidemics that affected the world in all economic, educational, health, and other aspects due to its rapid spread worldwide. The surge in infection rates made traditional diagnostic methods ineffective. Systems for automatic diagnosis and detection are crucial for controlling the outbreak. Other than PCR-RT, further diagnostic and detection techniques are needed. Individuals who receive positive test results often experience a range of symptoms, ranging from mild to severe, including coughing, fever, sore throats, and body pains. In more extreme cases, infected individuals may exhibit severe symptoms that make breathing challenging, ultimately leading to catastrophic organ failure. A hybrid approach called SDO-NMR-Hill has been developed for diagnosing COVID-19 based on a patient’s initial symptoms. This approach incorporates traits from three models, including two distinct feature selection optimization methods and a local search. Supply-demand optimization and the naked mole rat were preferred among metaheuristic methods because they have fewer parameters and a lower computing overhead, which can help you find superfluous and uninformative characteristics. Hill climbing was preferred among local search methods to maximize a criterion among several candidate solutions. We used decision trees, random forests, and adaptive boosting machine-learning classifiers in various experiments on three COVID-19 datasets. We carried out a natural selection of the classifier’s hyper-parameters to optimize outcomes. The optimal performance was attained using the adaptive boosting classifier, with an accuracy of 88.88% and 98.98% for the first and third datasets, respectively. The optimal performance for the second dataset was attained using the random forest classifier, with an accuracy of 97.97%. The suggested SDO-NMR-Hill model is evaluated using nine benchmark UCI datasets, and 15 different optimization techniques are contrasted

Traveling Salesman Problem

This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem. It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented. Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering

CENTRALIZED AND DISTRIBUTED OPTIMIZATION OF LOAD DISPATCH PROBLEM INCORPORATING DISTRIBUTED GENERATION

Ph.DDOCTOR OF PHILOSOPH

Feature selection algorithms for Malaysian dengue outbreak detection model

Dengue fever is considered as one of the most common mosquito borne diseases worldwide. Dengue outbreak detection can be very useful in terms of practical efforts to overcome the rapid spread of the disease by providing the knowledge to predict the next outbreak occurrence. Many studies have been conducted to model and predict dengue outbreak using different data mining techniques. This research aimed to identify the best features that lead to better predictive accuracy of dengue outbreaks using three different feature selection algorithms; particle swarm optimization (PSO), genetic algorithm (GA) and rank search (RS). Based on the selected features, three predictive modeling techniques (J48, DTNB and Naive Bayes) were applied for dengue outbreak detection. The dataset used in this research was obtained from the Public Health Department, Seremban, Negeri Sembilan, Malaysia. The experimental results showed that the predictive accuracy was improved by applying feature selection process before the predictive modeling process. The study also showed the set of features to represent dengue outbreak detection for Malaysian health agencies

Improvements on the bees algorithm for continuous optimisation problems

This work focuses on the improvements of the Bees Algorithm in order to enhance the algorithm’s performance especially in terms of convergence rate. For the first enhancement, a pseudo-gradient Bees Algorithm (PG-BA) compares the fitness as well as the position of previous and current bees so that the best bees in each patch are appropriately guided towards a better search direction after each consecutive cycle. This method eliminates the need to differentiate the objective function which is unlike the typical gradient search method. The improved algorithm is subjected to several numerical benchmark test functions as well as the training of neural network. The results from the experiments are then compared to the standard variant of the Bees Algorithm and other swarm intelligence procedures. The data analysis generally confirmed that the PG-BA is effective at speeding up the convergence time to optimum. Next, an approach to avoid the formation of overlapping patches is proposed. The Patch Overlap Avoidance Bees Algorithm (POA-BA) is designed to avoid redundancy in search area especially if the site is deemed unprofitable. This method is quite similar to Tabu Search (TS) with the POA-BA forbids the exact exploitation of previously visited solutions along with their corresponding neighbourhood. Patches are not allowed to intersect not just in the next generation but also in the current cycle. This reduces the number of patches materialise in the same peak (maximisation) or valley (minimisation) which ensures a thorough search of the problem landscape as bees are distributed around the scaled down area. The same benchmark problems as PG-BA were applied against this modified strategy to a reasonable success. Finally, the Bees Algorithm is revised to have the capability of locating all of the global optimum as well as the substantial local peaks in a single run. These multi-solutions of comparable fitness offers some alternatives for the decision makers to choose from. The patches are formed only if the bees are the fittest from different peaks by using a hill-valley mechanism in this so called Extended Bees Algorithm (EBA). This permits the maintenance of diversified solutions throughout the search process in addition to minimising the chances of getting trap. This version is proven beneficial when tested with numerous multimodal optimisation problems