Differential Evolution for the Offline and Online Optimization of Fed-Batch Fermentation Processes

Particle Swarm Optimization or Differential Evolution—A comparison

Modified Teaching–Learning-Based Optimization algorithm for global numerical optimization—A comparative study

This paper presents a hybrid optimization strategy for wideband antenna design that leverages the strengths of both Random Forest (RF) and Differential Evolution (DE) algorithms. The strategy employs DE for iteratively updating antenna parameters and RF for feature selection in the process of antenna performance optimization. Initially, DE is applied to update antenna parameters for a predetermined number of iterations, generating a dataset of antenna performance metrics. This dataset is then used to train an RF model, which identifies the importance of each design variable. Feature selection, guided by the RF-derived importance, is applied to reduce the dimensionality of the search space. DE subsequently continues the optimization process within this reduced parameter space. Validation of this hybrid approach is performed through the design of a wideband slot antenna and compared against standalone DE, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Simulated Annealing (SA). Results demonstrate that the proposed strategy significantly accelerates convergence, achieving the target reflection coefficient and gain with substantially fewer iterations than the other methods (reductions of 75.56%, 45%, 42.11%, and 50% compared to DE, GA, SA, and PSO, respectively). Furthermore, the hybrid strategy consistently finds superior solutions exhibiting lower loss values compared to the benchmark algorithms. The method offers a computationally efficient, interpretable, and effective approach to antenna optimization.

In recent years, various methods from the evolutionary computation (EC) field have been applied to electromagnetic (EM) design problems and have shown promising results. However, due to the high computational cost of the EM simulations, the efficiency of directly using evolutionary algorithms is often very low (e.g., several weeks' optimization time), which limits the application of these methods for many industrial applications. To address this problem, a new method, called surrogate model assisted differential evolution for antenna synthesis (SADEA), is presented in this paper. The key ideas are: (1) A Gaussian Process (GP) surrogate model is constructed on-line to predict the performances of the candidate designs, saving a lot of computationally expensive EM simulations. (2) A novel surrogate model-aware evolutionary search mechanism is proposed, directing effective global search even when a traditional high-quality surrogate model is not available. Three complex antennas and two mathematical benchmark problems are selected as examples. Compared with the widely used differential evolution and particle swarm optimization, SADEA can obtain comparable results, but achieves a 3 to 7 times speed enhancement for antenna design optimization.

Evolutionary algorithms (EAs) have been used to achieve optimal feedforward control in a number of fed-batch fermentation processes. Typically, the optimization purpose is to set the optimal feeding trajectory, being the feeding profile over time given by a piecewise linear function, in order to reduce the number of parameters to the optimization algorithm. In this work, a novel representation scheme for the encoding of the feeding trajectory over time is proposed. Each gene in the variable sized chromosome has two components: a time label and the real value of the variable. The new approach is compared with a traditional real-valued EA, with chromosomes of constant size and fixed discretization steps. Three distinct case studies are presented, taken from previous work from the authors and literature, all considering the optimization of fed-batch fermentation processes. The experimental results show that the proposed approach is capable of results better or at the same level of quality of the best traditional EAs and is able to automatically evolve the best discretization steps for each case, thus simplifying the EA's setup

Objective: In this paper, an improved hybrid differential evolution (IHDE) algorithm based on differential evolution (DE) algorithm and particle swarm optimization (PSO) has been proposed to solve the optimal power flow (OPF) problem of power system which is a multi-constrained, large-scale and nonlinear optimization problem. Method: In IHDE algorithm, the DE is employed as the main optimizer; and the three factors of PSO, which are inertia, cognition, and society, are used to improve the mutation of DE. Then the learning mechanism and the adaptive control of the parameters are added to the crossover, and the greedy selection considering the value of penalty function is proposed. Furthermore, the replacement mechanism is added to the IHDE for reducing the probability of falling into the local optimum. The performance of this method is tested on the IEEE30-bus and IEEE57-bus systems, and the generator quadratic cost and the transmission real power losses are considered as objective functions. Results: The simulation results demonstrate that IHDE algorithm can solve the OPF problem successfully and obtain the better solution compared with other methods reported in the recent literatures.

The performance of deep learning malware classifiers depends heavily on hyperparameter configuration. Deep learning malware detection benefits from principled hyperparameter optimization. This study evaluates six bio inspired optimizers across four neural architectures and three widely used malware data representations. Artificial Immune System methods include Clonal Selection, Immune Network, and a Dendritic Cell inspired optimizer. Evolutionary methods include Genetic Algorithm, Particle Swarm, and Differential Evolution. Baselines for each deep learning model were implemented using domain informed choices rather than naïve defaults to avoid overstating optimization gains and to reflect realistic practitioner practice. All runs were under a strictly matched evaluation budget (∼60 function evaluations per run) with five independent seeds per permutation. On API call sequences, LSTM produced the highest test accuracy near 0.991, with Differential Evolution and Particle Swarm frequently leading, while Transformer on the same dataset reached about 0.990. On PE headers, ANN achieved about 0.989 with Differential Evolution and Immune Network. Opcode n grams formed the most challenging setting, with the best CNN accuracy near 0.75 under multi class family labels. Artificial Immune System algorithms often reached the highest accuracies but typically at greater runtime cost, whereas Evolutionary Algorithms, especially Differential Evolution and Particle Swarm, were faster to strong solutions. under a strictly matched evaluation budget (∼60 function evaluations per run) with five independent seeds per permutation. The optimizers all perform comparatively well to each other on each dataset, with no statistical difference in test accuracy. The experiment also quantify accuracy versus computing tradeoffs, highlight dataset model synergies, and provide guidance on selecting model optimizer pairs for deployment-oriented scenarios. The research notes ceiling effects on API/PE and a modest, matched budget; future work will examine larger budgets and more challenging datasets to further probe optimizer differences under controlled evaluation.

Classification has been widely studied due to its practical applications. Feature selection aims to improve the classification accuracy by selecting a small feature subset from the original full feature set. However, identification of relevant features is not trivial due to the large search space. Particle swarm optimisation (PSO) is an efficient meta-heuristic algorithm which has shown to be promising in feature selection. However, traditional PSO uses its personal best experience and its historical best experience to determine its search direction, but this learning strategy may limit its performance for feature selection due to the premature convergence. Therefore, the potential of PSO needs to be further explored. In this paper, a new evolutionary learning algorithm termed hybridising PSO with differential evolution (HPSO-DE) is proposed to develop new feature selection methods. In HPSO-DE, differential evolution is applied to breed promising and efficient exemplars for PSO to guide its search, which is expected to not only preserve the diversity of the population but also guide particles to fly to promising areas. HPSO-DE is compared with three classic PSO variants and five traditional feature selection methods on 15 classification problems. The results show that the proposed algorithm can effectively achieve a higher classification accuracy with a smaller feature subset than the compared methods.

Global path planning is a challenging issue in the filed of mobile robotics due to its complexity and the nature of non-deterministic polynomial-time hard (NP-hard). Particle swarm optimization (PSO) has gained increasing popularity in global path planning due to its simplicity and high convergence speed. However, since the basic PSO has difficulties balancing exploration and exploitation, and suffers from stagnation, its efficiency in solving global path planning may be restricted. Aiming at overcoming these drawbacks and solving the global path planning problem efficiently, this paper proposes a hybrid PSO algorithm that hybridizes PSO and differential evolution (DE) algorithms. To dynamically adjust the exploration and exploitation abilities of the hybrid PSO, a novel PSO, the nonlinear time-varying PSO (NTVPSO), is proposed for updating the velocities and positions of particles in the hybrid PSO. In an attempt to avoid stagnation, a modified DE, the ranking-based self-adaptive DE (RBSADE), is developed to evolve the personal best experience of particles in the hybrid PSO. The proposed algorithm is compared with four state-of-the-art evolutionary algorithms. Simulation results show that the proposed algorithm is highly competitive in terms of path optimality and can be considered as a vital alternative for solving global path planning.

Real-life optimization problems (RLOPs) are common in numerous research disciplines. In literature, evolutionary algorithms (EAs) have been deemed an emerging field to solve RLOPs. Among popular EAs, Differential Evolution (DE) is clever algorithm to solve RLOPs. DE and its varied alternatives are highly influenced by improper operators like mutation and crossover. Mostly, DE doesn't compel to learn the optimum properties achieved in primary phase of the former aristocrats. In this article, a new DE (named as <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">mb</sup> DE) created on memory mechanism is offered to solve a renowned RLOP, specifically speed reducer design. It enclosed different crossover & mutation (swarm, crossover and mutation) made through particle swarm optimization (PSO) context. Experimental outcomes endorse the competency of <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">mb</sup> DE over various procedures.

Evolutionary Computation (EC) is a branch of Artificial Intelligence which encompasses heuristic optimization methods loosely based on biological evolutionary processes. These methods are efficient in finding optimal or near-optimal solutions in large, complex non-linear search spaces. While evolutionary algorithms (EAs) are comparatively slow in comparison to deterministic or sampling approaches, they are also inherently parallelizable. As technology shifts towards multicore and cloud computing, this overhead becomes less relevant, provided a parallel framework is used. In this chapter the authors discuss how to implement and run parallel evolutionary algorithms in the popular statistical programming language R. R has become the de facto language for statistical programming and it is widely used in biostatistics and bioinformatics due to the availability of thousands of packages to manipulate and analyze data. It is also extremely easy to parallelize routines within R, which makes it a perfect environment for evolutionary algorithms. EC is a large field of research, and many different algorithms have been proposed. While there is no single silver bullet that can handle all classes of problems, an algorithm that is extremely simple, efficient, and with good generalization properties is Differential Evolution (DE). Herein the authors discuss step-by-step how to implement DE in R and how to parallelize it. They then illustrate with a toy genome-wide association study (GWAS) how to identify candidate regions associated with a quantitative trait of interest.

MEMPSODE: A global optimization software based on hybridization of population-based algorithms and local searches

Optimization of fed-batch fermentation processes using the Backtracking Search Algorithm

This brief paper reports a hybrid algorithm we developed recently to solve the global optimization problems of multimodal functions, by combining the advantages of two powerful population-based metaheuristics—differential evolution (DE) and particle swarm optimization (PSO). In the hybrid denoted by DEPSO, each individual in one generation chooses its evolution method, DE or PSO, in a statistical learning way. The choice depends on the relative success ratio of the two methods in a previous learning period. The proposed DEPSO is compared with its PSO and DE parents, two advanced DE variants one of which is suggested by the originators of DE, two advanced PSO variants one of which is acknowledged as a recent standard by PSO community, and also a previous DEPSO. Benchmark tests demonstrate that the DEPSO is more competent for the global optimization of multimodal functions due to its high optimization quality.

In the event of a fault isolation process, all loads located downstream from the faulted point become out of service, and as a consequence, the power interruption affects a greater portion of the radial distribution system. This paper proposes an optimal Service Restoration (SR) method that entails changing the network topology configuration via optimal tie-switch and section switch combinations. However, when the network topology configuration is performed, it results in increased load currents. As a result, some Protective Devices (PDs) can operate undesirably and some network branches may become unprotected. Therefore, it is essential to consider protection constraints in the SR problem to maintain service continuity during power interruptions. The proposed method aims at optimal SR with minimum out-of-service loads, minimum power loss, and improved voltage profiles and at the same time ensures PDs operate correctly during the normal and overloading conditions. The proposed method was carried out on the Debre Markos distribution networks, using the Teaching Learning Based Optimization (TLBO), Particle Swarm Optimization (PSO), and Differential Evolutionary (DEV) algorithms. The proposed SR was carried out considering and without considering protection constraints. The obtained SR topology was not feasible for SR without considering protection constraints, since some PDs fail to operate properly in normal loading conditions. After executing the proposed SR algorithms by considering protection constraints for a single fault case, the power loss reductions in TLBO, DEV, and PSO were 64.9073%, 45.9073%, and 55.358 %, respectively. The minimum voltage profiles obtained in each proposed TLBO, DEV, and PSO algorithm were 0.96%, 0.95%, and 0.96%, respectively. In each algorithm, except for the branch under fault, all healthy out-of-service branches were restored. When the protection constraints were considered in an optimal SR, load current did not exceed the rating of the fuses. The results show the importance of considering protection constraints during SR to prevent dysfunction of the PDs in the network. Comparative analyses were carried out on each algorithm and TLBO algorithms performed better than PSO and DEV for search functions.