A Study in function optimization with the breeder genetic algorithm

Optimization is concerned with the finding of global optima (hence the name) of problems that can be cast in the form of a function of several variables and constraints thereof. Among the searching methods, {em Evolutionary Algorithms} have been shown to be adaptable and general tools that have often outperformed traditional {em ad hoc} methods. The {em Breeder Genetic Algorithm} (BGA) combines a direct representation with a nice conceptual simplicity. This work contains a general description of the algorithm and a detailed study on a collection of function optimization tasks. The results show that the BGA is a powerful and reliable searching algorithm. The main discussion concerns the choice of genetic operators and their parameters, among which the family of Extended Intermediate Recombination (EIR) is shown to stand out. In addition, a simple method to dynamically adjust the operator is outlined and found to greatly improve on the already excellent overall performance of the algorithm.Postprint (published version

An Application example of the breeder genetic algorithm to function optimization

Peer Reviewe

Design of power system stabilizers using evolutionary algorithms

Includes synopsis.Includes bibliographical references (leaves 151-159).Includes bibliographical references (leaves 125-134).Over the past decades, the issue of low frequency oscillations has been of major concern to power system engineers. These oscillations range from 0.1 to 3Hz and tend to be poorly damped especially in systems equipped with high gain fast acting AVRs and highly interconnected networks. If these oscillations are not adequately damped, they may sustain and grow, which may lead to system separation and loss of power transfer

Operator and parameter adaptation in genetic algorithms

Genetic Algorithms are a class of powerful, robust search techniques based on genetic inheritance and the Darwinian metaphor of “Natural Selection”. These algorithms maintaina finite memory of individual points on the search landscape known as the “population”. Members of the population are usually represented as strings written over some fixed alphabet, each of which has a scalar value attached to it reflecting its quality or “fitness”. Thesearch may be seen as the iterative application of a number of operators, such as selection, recombination and mutation, to the population with the aim of producing progressively fitter individuals. These operators are usually static, that is to say that their mechanisms, parameters, and probability of application are fixed at the beginning and constant throughout the run of thealgorithm. However there is an increasing body of evidence that not only is there no single choice of operators which is optimal for all problems, but that in fact the optimal choice of operators for a given problem will be time-variant i.e. it will depend on such factors as thedegree of convergence of the population. Based on theoretical and practical approaches, a number of authors have proposed methods of adaptively controlling one or more of the operators, usually invoking some kind of “meta-learning” algorithm, in order to try and improvethe performance of the Genetic Algorithm as a function optimiser.In this paper we describe the background to these approaches, and suggest a framework for their classification based on the learning strategy used to control them, and what facets of the algorithm are susceptible to adaptation. We then review a number of significant pieces of work within this context, and draw some conclusions about the relative merits of variousapproaches and promising directions for future work

CIXL2: A Crossover Operator for Evolutionary Algorithms Based on Population Features

In this paper we propose a crossover operator for evolutionary algorithms with real values that is based on the statistical theory of population distributions. The operator is based on the theoretical distribution of the values of the genes of the best individuals in the population. The proposed operator takes into account the localization and dispersion features of the best individuals of the population with the objective that these features would be inherited by the offspring. Our aim is the optimization of the balance between exploration and exploitation in the search process. In order to test the efficiency and robustness of this crossover, we have used a set of functions to be optimized with regard to different criteria, such as, multimodality, separability, regularity and epistasis. With this set of functions we can extract conclusions in function of the problem at hand. We analyze the results using ANOVA and multiple comparison statistical tests. As an example of how our crossover can be used to solve artificial intelligence problems, we have applied the proposed model to the problem of obtaining the weight of each network in a ensemble of neural networks. The results obtained are above the performance of standard methods

Evolutionary multi-objective decision support systems for conceptual design

Merged with duplicate record 10026.1/2328 on 07.20.2017 by CS (TIS)In this thesis the problem of conceptual engineering design and the possible use of adaptive search techniques and other machine based methods therein are explored. For the multi-objective optimisation (MOO) within conceptual design problem, genetic algorithms (GA) adapted to MOO are used and various techniques explored: weighted sums, lexicographic order, Pareto method with and without ranking, VEGA-like approaches etc. Large number of runs are performed for findingZ Dth e optimal configuration and setting of the GA parameters. A novel method, weighted Pareto method is introduced and applied to a real-world optimisation problem. Decision support methods within conceptual engineering design framework are discussed and a new preference method developed. The preference method for translating vague qualitative categories (such as "more important 91 , 4m.9u ch less important' 'etc. ) into quantitative values (numbers) is based on fuzzy preferences and graph theory methods. Several applications of preferences are presented and discussed: * in weighted sum based optimisation methods; s in weighted Pareto method; * for ordering and manipulating constraints and scenarios; e for a co-evolutionary, distributive GA-based MOO method; The issue of complexity and sensitivity is addressed as well as potential generalisations of presented preference methods. Interactive dynamical constraints in the form of design scenarios are introduced. These are based on a propositional logic and a fairly rich mathematical language. They can be added, deleted and modified on-line during the design session without need for recompiling the code. The use of machine-based agents in conceptual design process is investigated. They are classified into several different categories (e. g. interface agents, search agents, information agents). Several different categories of agents performing various specialised task are developed (mostly dealing with preferences, but also some filtering ones). They are integrated with the conceptual engineering design system to form a closed loop system that includes both computer and designer. All thesed ifferent aspectso f conceptuale ngineeringd esigna re applied within Plymouth Engineering Design Centre / British Aerospace conceptual airframe design project.British Aerospace Systems, Warto

Automated Students Attendance System

The Automated Students' Attendance System is a system that takes the attendance of students in a class automatically. The system aims to improve the current attendance system that is done manually. This work presents the computerized system of automated students' attendance system to implement genetic algorithms in a face recognition system. The extraction of face template particularly the T-zone (symmetrical between the eyes, nose and mouth) is performed based on face detection using specific HSV colour space ranges followed by template matching. Two types of templates are used; one on edge detection and another on the intensity plane in YIQ colour space. Face recognition with genetic algorithms will be performed to achieve an automated students' attendance system. With the existence of this attendance system, the occurrence of truancy could be reduced tremendously

Evolucijski algoritam temeljen na off-line planeru putanje za navigaciju bespilotnih letjelica

An off-line path planner for Unmanned Air Vehicles is presented. The planner is based on Evolutionary Algorithms, in order to calculate a curved pathline with desired characteristics in a three-dimensional environment. The pathline is represented using B-Spline curves, with the coordinates of its control points being the genes of the Evolutionary Algorithm artificial chromosome. The method was tested in an artificial three-dimensional terrain, for different starting and ending points, providing very smooth pathlines under difficult constraints.Predstavljen je off-line planer putanje za bespilotne letjelice. Planer je temeljen na evolucijskim algoritmima za proračun zakrivljene putanje sa željenim karakteristikama u 3D prostoru. Putanja je predstavljena pomoću B-spline krivulja, gdje su koordinate kontrolnih točaka geni umjetnih kromosoma evolucijskih algoritama. Metoda je provjerena na umjetnom 3D prostoru s različitim početnim i konačnim točkama, gdje su dobivene vrlo glatke putanje uz zadovoljenje strogih ograničenja

Maximum Torque per Ampere Control of Permanent Magnet Synchronous Motor Using Genetic Algorithm

 Permanent magnet synchronous motor (PMSM) drives have many advantages over other drives, i.e. high efficiency and high power density. Particularly, PMSMs are epoch-making and are intensively studied among researchers, scientists and engineers. This paper deals with a novel high performance controller based on genetic algorithm. The scheme allows the motor to be driven with maximum torque per ampere characteristic. In this paper assuming an appropriate fitness function, the optimum values for d-axis current of motor set points at each time are found and then applied to the controller. Simulation results show the successful operation of the proposed controller

Classification of hypoglycemic episodes for Type 1 diabetes mellitus based on neural networks

Hypoglycemia is dangerous for Type 1 diabetes mellitus (T1DM) patients. Based on the physiological parameters, we have developed a classification unit with hybridizing the approaches of neural networks and genetic algorithm to identify the presences of hypoglycemic episodes for TIDM patients. The proposed classification unit is built and is validated by using the real T1DM patients' data sets collected from Department of Health, Government of Western Australia. Experimental results show that the proposed neural network based classification unit can achieve more accurate results on both trained and unseen T1DM patients' data sets compared with those developed based on the commonly used classification methods for medical diagnosis including statistical regression, fuzzy regression and genetic programming