Evolutionary Algorithm with Diversity-Reference Adaptive Control in Dynamic Environments

2015 ◽  
Vol 24 (01) ◽  
pp. 1450013 ◽  
Author(s):  
Maury Meirelles Gouvêa ◽  
Aluizio F. R. Araújo

Evolutionary algorithms (EAs) can be used to find solutions in dynamic environments. In such cases, after a change in the environment, EAs can either be restarted or they can take advantage of previous knowledge to resume the evolutionary process. The second option tends to be faster and demands less computational effort. The preservation or growth of population diversity is one of the strategies used to advance the evolutionary process after modifications to the environment. We propose a new adaptive method to control population diversity based on a model-reference. The EA evolves the population whereas a control strategy, independently, handles the population diversity. Thus, the adaptive EA evolves a population that follows a diversity-reference model. The proposed model, called the Diversity-Reference Adaptive Control Evolutionary Algorithm (DRAC), aims to maintain or increase the population diversity, thus avoiding premature convergence, and assuring exploration of the solution space during the whole evolutionary process. We also propose a diversity models based on the dynamics of heterozygosity of the population, as models to be tracked by the diversity control. The performance of DRAC showed promising results when compared with the standard genetic algorithm and six other adaptive evolutionary algorithms in 14 different experiments with three different types of environments.

2011 ◽  
Vol 2 (1) ◽  
pp. 63-85 ◽  
Author(s):  
Eunice Oliveira ◽  
Carlos Henggeler Antunes ◽  
Álvaro Gomes

The incorporation of preferences into Evolutionary Algorithms (EA) presents some relevant advantages, namely to deal with complex real-world problems. It enables focus on the search thus avoiding the computation of irrelevant solutions from the point of view of the practical exploitation of results (thus minimizing the computational effort), and it facilitates the integration of the DM’s expertise into the solution search process (thus minimizing the cognitive effort). These issues are particularly important whenever the number of conflicting objective functions and/or the number of non-dominated solutions in the population is large. In EvABOR (Evolutionary Algorithm Based on an Outranking Relation) approaches preferences are elicited from a decision maker (DM) with the aim of guiding the evolutionary process to the regions of the space more in accordance with the DM’s preferences. The preferences are captured and made operational by using the technical parameters of the ELECTRE TRI method. This approach is presented and analyzed using some illustrative results of a case study of electrical networks.


Author(s):  
Eunice Oliveira ◽  
Carlos Henggeler Antunes ◽  
Álvaro Gomes

The incorporation of preferences into Evolutionary Algorithms (EA) presents some relevant advantages, namely to deal with complex real-world problems. It enables focus on the search thus avoiding the computation of irrelevant solutions from the point of view of the practical exploitation of results (thus minimizing the computational effort), and it facilitates the integration of the DM’s expertise into the solution search process (thus minimizing the cognitive effort). These issues are particularly important whenever the number of conflicting objective functions and/or the number of non-dominated solutions in the population is large. In EvABOR (Evolutionary Algorithm Based on an Outranking Relation) approaches preferences are elicited from a decision maker (DM) with the aim of guiding the evolutionary process to the regions of the space more in accordance with the DM’s preferences. The preferences are captured and made operational by using the technical parameters of the ELECTRE TRI method. This approach is presented and analyzed using some illustrative results of a case study of electrical networks.


2012 ◽  
Vol 239-240 ◽  
pp. 1528-1531 ◽  
Author(s):  
Xue Bai Zhang ◽  
Ge Xiang Zhang ◽  
Ji Xiang Cheng

To improve the performance of Quantum-inspired Evolutionary algorithm based on P Systems (QEPS), this paper presents an improved QEPS with a Dynamic Membrane Structure (QEPS-DMS) to solve knapsack problems. QEPS-DMS combines quantum-inspired evolutionary algorithms (QIEAs) with a P system with a dynamic membrane structure. In QEPS-DMS, a QIEA is considered as a subalgorithm to put inside each elementary membrane of a one-level membrane structure, which is dynamically adjusted in the process of evolution by applying a criterion for measuring population diversity. The dynamic adjustment includes the processes of membrane dissolution and creation. Knapsack problems are applied to test the effectiveness of QEPS-DMS. Experimental results show that QEPS-DMS outperforms QEPS and three variants of QIEAs recently reported in the literature.


Author(s):  
O. P. Tomchina ◽  
D. N. Polyakhov ◽  
O. I. Tokareva ◽  
A. L. Fradkov

Introduction: The motion of many real world systems is described by essentially non-linear and non-stationary models. A number of approaches to the control of such plants are based on constructing an internal model of non-stationarity. However, the non-stationarity model parameters can vary widely, leading to more errors. It is only assumed in this paper that the change rate of the object parameters is limited, while the initial uncertainty can be quite large.Purpose: Analysis of adaptive control algorithms for non-linear and time-varying systems with an explicit reference model, synthesized by the speed gradient method.Results: An estimate was obtained for the maximum deviation of a closed-loop system solution from the reference model solution. It is shown that with sufficiently slow changes in the parameters and a small initial uncertainty, the limit error in the system can be made arbitrarily small. Systems designed by the direct approach and systems based on the identification approach are both considered. The procedures for the synthesis of an adaptive regulator and analysis of the synthesized system are illustrated by an example.Practical relevance: The obtained results allow us to build and analyze a broad class of adaptive systems with reference models under non-stationary conditions.


2018 ◽  
Vol 27 (4) ◽  
pp. 643-666 ◽  
Author(s):  
J. LENGLER ◽  
A. STEGER

One of the easiest randomized greedy optimization algorithms is the following evolutionary algorithm which aims at maximizing a function f: {0,1}n → ℝ. The algorithm starts with a random search point ξ ∈ {0,1}n, and in each round it flips each bit of ξ with probability c/n independently at random, where c > 0 is a fixed constant. The thus created offspring ξ' replaces ξ if and only if f(ξ') ≥ f(ξ). The analysis of the runtime of this simple algorithm for monotone and for linear functions turned out to be highly non-trivial. In this paper we review known results and provide new and self-contained proofs of partly stronger results.


Author(s):  
Manfred Ehresmann ◽  
Georg Herdrich ◽  
Stefanos Fasoulas

AbstractIn this paper, a generic full-system estimation software tool is introduced and applied to a data set of actual flight missions to derive a heuristic for system composition for mass and power ratios of considered sub-systems. The capability of evolutionary algorithms to analyse and effectively design spacecraft (sub-)systems is shown. After deriving top-level estimates for each spacecraft sub-system based on heuristic heritage data, a detailed component-based system analysis follows. Various degrees of freedom exist for a hardware-based sub-system design; these are to be resolved via an evolutionary algorithm to determine an optimal system configuration. A propulsion system implementation for a small satellite test case will serve as a reference example of the implemented algorithm application. The propulsion system includes thruster, power processing unit, tank, propellant and general power supply system masses and power consumptions. Relevant performance parameters such as desired thrust, effective exhaust velocity, utilised propellant, and the propulsion type are considered as degrees of freedom. An evolutionary algorithm is applied to the propulsion system scaling model to demonstrate that such evolutionary algorithms are capable of bypassing complex multidimensional design optimisation problems. An evolutionary algorithm is an algorithm that uses a heuristic to change input parameters and a defined selection criterion (e.g., mass fraction of the system) on an optimisation function to refine solutions successively. With sufficient generations and, thereby, iterations of design points, local optima are determined. Using mitigation methods and a sufficient number of seed points, a global optimal system configurations can be found.


2014 ◽  
Vol 29 (5) ◽  
pp. 639-652 ◽  
Author(s):  
Zarina Samigulina ◽  
Olga Shiryayeva ◽  
Galina Samigulina ◽  
Hassen Fourati

2011 ◽  
Vol 383-390 ◽  
pp. 79-85
Author(s):  
Dong Yuan ◽  
Xiao Jun Ma ◽  
Wei Wei

Aiming at the problems such as switch impulsion, insurmountability for influence caused by nonlinearity in one tank gun control system which adopts double PID controller to realize the multimode switch control between high speed and low speed movement, the system math model is built up; And then, Model Reference Adaptive Control (MRAC) method based on nonroutine reference model is brought in and the adaptive gun controller is designed. Consequently, the compensation of nonlinearity and multimode control are implemented. Furthermore, the Tracking Differentiator (TD) is affiliated to the front of controller in order to restrain the impulsion caused by mode switch. Finally, the validity of control method in this paper is verified by simulation.


Sign in / Sign up

Export Citation Format

Share Document