A novel evolutionary algorithm approach to the implementation of rule-based controllers

Multi-sensor fusion: an Evolutionary algorithm approach

In this paper, the evolutionary algorithms approach is applied to the parameterization of a mathematical model describing the Mössbauer spectra of nanogranular (or nanoparticle) magnetic systems. These systems exhibit physical properties very different from bulk specimens being of great interest for material science and its use as biosensors, magneto sensors, data storage, and magnetic fluids. The purpose of this work is to compare the performance between the Differential Evolution and the Evolutionary Strategies algorithms to optimize the model parameters which best fit the experimental Mössbauer spectra of nanoscale magnetic particles. Spectra of two samples (??iron foil and NiFe2O4 nanoparticles) were recorded, at room temperature, by a conventional Mössbauer spectrometer using a scintillation detector in transmission geometry with a 57Co/Rh source. Fits to Mössbauer spectra were done using spin hamiltonians to describe both the electronic and nuclear interactions; a model of superparamagnetic relaxation of two levels (spin ½) and stochastic theory; a lognormal particle size distribution function as well as a dependency of the magnetic transition temperature and the anisotropy constant on particle diameter. The evolutionary algorithms have been implemented using Python programming language. For comparison, the two algorithms obey the termination criterion of 6,000 evaluations of the objective function. The results presented show the efficiency of these algorithms in the optimization of the parameters and on the fits of the spectra.

WITHDRAWN: WITHDRAWN: An evolutionary algorithm approach for vehicle routing problems with backhauls

Evolutionary algorithm approaches to solving multiobjective optimization problems have received much attention in recent years. This is one of three books published in the last year or so on the subject, and Multiobjective Evolutionary Algorithms and Applications is distinguished by its claim to being written for a wide readership of engineers, researchers, senior undergraduate students and graduate students. The book is organized into 14 chapters, with the first and second chapters providing a brief introduction into multi-objective optimization and a historical summary of the basic similarities and differences between several significant multiobjective evolutionary algorithm (MOEA) approaches. Chapter 3 provides a more in-depth look at the important subject of distribution preservation. Chapters 4, 5 and 6 introduce the author's own MOEA features and approaches. In Chapter 4, the author's suggestions for implementing hard and soft goal prioritizations and problem constraints and an adaptive fitness sharing method are presented. Chapters 5 and 6 do the same for adaptive dynamic population sizes and distributed cooperative coevolution respectively. Chapter 7 introduces potential advantages from adaptive adjustment of the size of the search space.

PurposeThis paper aims to present an evolutionary algorithm (EA) to accelerate the convergence for the radiative transfer equation (RTE) numerical solution using high-order and high-resolution schemes by the relaxation coefficients optimization.Design methodology/approachThe objective function minimizes the residual value difference between iterations in each control volume until its difference is lower than the convergence criterion. The EA approach is evaluated in two configurations, a two-dimensional cavity with scattering media and absorbing media.FindingsExperimental results show the capacity to obtain the numerical solution for both cases on all interpolation schemes tested by the EA approach. The EA approach reduces CPU time for the RTE numerical solution using SUPERBEE, SWEBY and MUSCL schemes until 97% and 135% in scattering and absorbing media cases, respectively. The relaxation coefficients optimized every two numerical solution iterations achieve a significant reduction of the CPU time compared to the deferred correction procedure with fixed relaxation coefficients.Originality/valueThe proposed EA approach for the RTE numerical solution effectively reduces the CPU time compared to the DC procedure with fixed relaxation coefficients.

Tin monoxide, SnO, and its analog, lead monoxide, PbO, have the same tetragonal P4/nmm structure, shaped by nonbonding dispersion forces and lone pairs. The high-pressure phases of SnO and PbO have been explored in several experimental and theoretical studies, with conflicting results. In this study, the high-pressure structures of SnO and PbO are investigated using density functional theory calculations combined with an evolutionary algorithm to identify novel high-pressure phases. We propose that the monoclinic P21/m SnO and orthorhombic Pmmn PbO phases, which are metastable at 0 GPa, are a slight rearrangement of the tetragonal P4/nmm-layered structure. These orthorhombic (and their closely related monoclinic) phases become more favored than the tetragonal phase upon compression. In particular, the transition pressures to the orthorhombic γ-phase Pmn21 of SnO/PbO and the monoclinic phase P21/m of SnO are found to be consistent with experimental studies. Two new high-pressure SnO/PbO polymorphs are predicted: the orthorhombic Pbcm phase of SnO and the monoclinic C2/m of PbO. These phases are stabilized in our calculations when P > 65 GPa and P > 50 GPa, respectively. The weakening of the lone pair localization and elastic instability are the main drivers of pressure-induced phase transitions. Modulations of the SnO/PbO electronic structure due to structural transitions upon compression are also discussed.

This paper investigates the use of evolutionary and other meta-heuristic algorithms for routing problems where vehicle operating cost (VOC) and specifically, road roughness, has a significant impact. Three algorithms were implemented, namely a greedy heuristic, simulated annealing and CMA-ES. Simulated annealing delivered statistically significant results and was used to evaluate routes with and without VOC.

We attempt to find solutions to the fully fuzzified linear program where all the parameters and variables are fuzzy numbers. We first change the problem of maximizing a fuzzy number, the value of the objective function, into a multiobjective fuzzy linear programming problem. We prove that fuzzy flexible programming can be used to explore the whole undominated set to the multiobjective fuzzy linear program. An evolutionary algorithm is designed to solve the fuzzy flexible program. The program was applied to two applications with good solutions.

Facility location under uncertain environments is an important and challenging problem. The problem deals with the optimal placement of facilities that serve a set of spatially distributed nodes. One way to deal with this problem is to model uncertainty by means of scenarios and to optimise some robustness criteria such as the average and maximum regrets over these scenarios. We propose to model the robust design as a bi-objective optimisation problem and to use a well-known multi-objective evolutionary algorithm, the NSGA-II, to solve it. We also propose to use the bi-objective optimisation framework to analyse the effects of variations in the number of facilities to install, and of nodes to be served, on the quality of the Pareto solutions. Computational experiments show that the proposal can be used to design robust solutions and to study the effects of changes in the system parameters on the quality of the generated solutions.

Identifying complex interactions among millions of single nucleotide polymorphisms (SNPs) is a key challenge in Genome-Wide Association Studies (GWAS), offering crucial insights into the genetic architecture of complex diseases. Evolutionary algorithm (EA)-based methods have gained significant attention for their global search capabilities, controllable runtime, and multi-objective optimization potential. However, when applied to high-dimensional GWAS datasets, many existing EA-based methods encounter challenges such as getting trapped in local optima and facing high computational demands. To address these issues, the evolutionary multitasking (EMT) paradigm presents a promising solution, enhancing population diversity and convergence speed through collaborative, cross-task knowledge sharing. Furthermore, the multi-tasking framework and EA can be seamlessly deployed across multiple Graphics Processing Units (GPUs), leveraging their high parallelism and aggregated memory bandwidth. Therefore, we introduce a GPU-powered evolutionary auxiliary multitasking algorithm (GEAMT) for fast SNP interaction detection. GEAMT first constructs a main task along with several low-dimensional auxiliary tasks to redefine the original task. The main task explores the entire search space, while the auxiliary tasks search distinct subspaces to enhance local optimization capabilities. In each iteration, the auxiliary tasks transfer high-quality information to the main task via an information transfer mechanism. Subsequently, an auxiliary task update strategy based on feature regrouping is employed to switch the search subspaces of the auxiliary tasks. The final results are derived from the Pareto-optimal solutions of the main task. Implemented across multiple GPUs, GEAMT achieves notable scalability and efficiency. Comprehensive experiments on both synthetic and real-world datasets demonstrate that GEAMT can significantly enhance search accuracy and speed up the search process.

There has been a steady growth in interest in niching approaches within the evolutionary computation community, as an increasing number of real world problems are discovered that exhibit multi-modality of varying degrees of intensity (modes). It is often useful to locate and memorise the modes encountered - this is because the optimal decision parameter combinations discovered may not be feasible when moving from a mathematical model emulating the real problem to engineering an actual solution, or the model may be in error in some regions. As such a range of disparate modal solutions is of practical use. This paper investigates the use of a collection of localised surrogate models for niche/mode discovery, and analyses the performance of a novel evolutionary algorithm (EA) which embeds these surrogates into its search process. Results obtained are compared to the published performance of state-of-the-art evolutionary algorithms developed for multi-modal problems. We find that using a collection of localised surrogates not only makes the problem tractable from a model-fitting viewpoint, it also produces competitive results with other EA approaches.

Any evolutionary algorithm tends to end up in a local optimum. A new approach based on an evolutionary algorithm named as Diversity Driven Multi-Parent Evolutionary Algorithm with Adaptive non-uniform mutation is presented. In the proposed algorithm, Non-uniform mutation is used to maintain diversity in the explored solutions. Fitness variance, which signifies solution space aggregation, is used to detect the premature convergence of the population to a local optimum. The term multi-parent is used in the context of more than two parents participating in crossover operation. After multi-parent selection for cross-over to generate new solutions, the non-uniform adaptive mutation is performed, which in turn is triggered by the diminishing value of fitness variance of candidate solutions and pushes solutions out of local optimum. Hence, it can be said that the algorithm is driven by the diversity of the population and overcomes the tendency of evolutionary algorithms to stuck in local optimum. The performance of this algorithm is tested on 23 basic benchmarks, CEC05 functions, and CEC17 functions. As CEC17 benchmark functions include constraint problems, a constraint-handling technique is proposed based on the fuzzy set theory. In the proposed constrained handling strategy, constraint violation is also taken as another objective along with the main objective. The decision to accept or discard the solution is based on the fuzzy set theory. The values of constraint violation and objective function are calculated and fuzzified by calculating membership values by considering the main objective and constraint violation as triangular fuzzy functions. The best solutions are selected based on cardinal priority ranking. The obtained results from the proposed algorithm are compared with the results available in the literature. The result indicates that this algorithm is competitive, even with a smaller number of function evaluations.

In this research, an evolutionary genetic algorithm based approach is proposed for designing independent machine cells in cellular manufacturing in the presence of operation based alternative process plans for parts. Manufacturing parameters, such as production volume, usage factor for process plans, machine flexibility and cell size and machine-operation compatibility in terms of a normalised rating factor are also considered during cell design. The problem is formulated as a multi-objective optimisation model and solved using a non-dominated sorting genetic algorithm (NSGA). A unique feature of the proposed method is that it takes into account the unequal efficiency of machines in performing different operations. Some new similarity and diversity measures among operations and machines are also proposed during the clustering of machines. The formation of machine cells has been treated as a minimisation of inter-cell traffic while maximising a defined efficiency function. An illustrated problem and comparisons with existing data are given.

An important problem in the study of evolutionary algorithms is how to continuously predict promising solutions while simultaneously escaping from local optima. In this paper, we propose an elitist probability schema (EPS) for the first time, to the best of our knowledge. Our schema is an index of binary strings that expresses the similarity of an elitist population at every string position. EPS expresses the accumulative effect of fitness selection with respect to the coding similarity of the population. For each generation, EPS can quantify the coding similarity of the population objectively and quickly. One of our key innovations is that EPS can continuously predict promising solutions while simultaneously escaping from local optima in most cases. To demonstrate the abilities of the EPS, we designed an elitist probability schema genetic algorithm and an elitist probability schema compact genetic algorithm. These algorithms are estimations of distribution algorithms (EDAs). We provided a fair comparison with the persistent elitist compact genetic algorithm (PeCGA), quantum-inspired evolutionary algorithm (QEA), and particle swarm optimization (PSO) for the 0---1 knapsack problem. The proposed algorithms converged quicker than PeCGA, QEA, and PSO, especially for the large knapsack problem. Furthermore, the computation time of the proposed algorithms was less than some EDAs that are based on building explicit probability models, and was approximately the same as QEA and PSO. This is acceptable for evolutionary algorithms, and satisfactory for EDAs. The proposed algorithms are successful with respect to convergence performance and computation time, which implies that EPS is satisfactory.

In the research of cloud computing, the advantages and disadvantages of cloud task scheduling algorithm will affect the operation efficiency and service quality of the whole cloud computing system. Evolutionary algorithm is the sum of a series of specific algorithms inspired by the phenomenon of biological evolution in nature. One of the common points of these algorithms is that individuals must be mutated according to certain rules in the running process, so as to avoid falling into local optimum. In order to improve the efficiency of cloud task scheduling in cloud computing, this paper proposes a new mutation strategy which changes the genetic algorithm in evolutionary algorithm. It uses cloudsim platform to simulate cloud task scheduling in cloud computing, and uses particle swarm optimization algorithm to optimize its parameters. The experimental results show that the proposed evolutionary algorithm with improved mutation strategy has the function of cloud task scheduling, and its performance is also improved after the parameters are optimized by particle swarm optimization algorithm. The proposed algorithm improves the mutation step and explores the essence of mutation in evolutionary algorithm, which provides a reference for other research.