Self-adaptive parameters in genetic algorithms

2004 ◽  
Author(s):  
Eric Pellerin ◽  
Luc Pigeon ◽  
Sylvain Delisle
Keyword(s):  
Genetic Algorithms ◽  
Adaptive Parameters ◽  
Self Adaptive

A Comparison Study of Self-Adaptation in Evolution Strategies and Real-Coded Genetic Algorithms

2001 ◽  
Vol 9 (2) ◽  
pp. 223-241 ◽  
Author(s):  
Hajime Kita
Keyword(s):  
Genetic Algorithms ◽  
The Self ◽  
Evolution Strategies ◽  
Search Spaces ◽  
Adaptive Parameters ◽  
Decision Variables ◽  
Adaptive Mechanisms ◽  
Self Adaptation ◽  
Real Coded Genetic Algorithms ◽  
Self Adaptive

This paper discusses the self-adaptive mechanisms of evolution strategies (ES) and real-coded genetic algorithms (RCGA) for optimization in continuous search spaces. For multi-membered evolution strategies, a self-adaptive mechanism of mutation parameters has been proposed by Schwefel. It introduces parameters such as standard deviations of the normal distribution for mutation into the genetic code and lets them evolve by selection as well as the decision variables. In the RCGA, crossover or recombination is used mainly for search. It utilizes information on several individuals to generate novel search points, and therefore, it can generate offspring adaptively according to the distribution of parents without any adaptive parameters. The present paper discusses characteristics of these two self-adaptive mechanisms through numerical experiments. The self-adaptive characteristics such as translation, enlargement, focusing, and directing of the distribution of children generated by the ES and the RCGA are examined through experiments.

SELF-ADAPTIVE LEARNING CLASSIFIER SYSTEM

2010 ◽  
Vol 19 (01) ◽  
pp. 275-296 ◽  
Author(s):  
OLGIERD UNOLD
Keyword(s):  
Mutation Rate ◽  
Adaptive Learning ◽  
Adaptive Mutation ◽  
Learning Classifier System ◽  
Classifier System ◽  
Learning Classifier ◽  
Adaptive Parameters ◽  
Proposed Model ◽  
Fixed Parameter ◽  
Self Adaptive

This article introduces a new kind of self-adaptation in discovery mechanism of learning classifier system XCS. Unlike the previous approaches, which incorporate self-adaptive parameters in the representation of an individual, proposed model evolves competitive population of the reduced XCSs, which are able to adapt both classifiers and genetic parameters. The experimental comparisons of self-adaptive mutation rate XCS and standard XCS interacting with 11-bit, 20-bit, and 37-bit multiplexer environment were provided. It has been shown that adapting the mutation rate can give an equivalent or better performance to known good fixed parameter settings, especially for computationally complex tasks. Moreover, the self-adaptive XCS is able to solve the problem of inappropriate for a standard XCS parameters.

scholarly journals A Novel Mating Approach for Genetic Algorithms

2013 ◽  
Vol 21 (2) ◽  
pp. 197-229 ◽  
Author(s):  
Severino F. Galán ◽  
Ole J. Mengshoel ◽  
Rafael Pinter
Keyword(s):  
Genetic Algorithms ◽  
Random Mating ◽  
Adaptive Strategy ◽  
Mating Strategies ◽  
Function Optimization ◽  
The Novel ◽  
Independent Manner ◽  
Novel Approach ◽  
Domain Independent ◽  
Self Adaptive

Genetic algorithms typically use crossover, which relies on mating a set of selected parents. As part of crossover, random mating is often carried out. A novel approach to parent mating is presented in this work. Our novel approach can be applied in combination with a traditional similarity-based criterion to measure distance between individuals or with a fitness-based criterion. We introduce a parameter called the mating index that allows different mating strategies to be developed within a uniform framework: an exploitative strategy called best-first, an explorative strategy called best-last, and an adaptive strategy called self-adaptive. Self-adaptive mating is defined in the context of the novel algorithm, and aims to achieve a balance between exploitation and exploration in a domain-independent manner. The present work formally defines the novel mating approach, analyzes its behavior, and conducts an extensive experimental study to quantitatively determine its benefits. In the domain of real function optimization, the experiments show that, as the degree of multimodality of the function at hand grows, increasing the mating index improves performance. In the case of the self-adaptive mating strategy, the experiments give strong results for several case studies.

Sign in / Sign up

Export Citation Format

Share Document