نتایج جستجو برای: adaptive mutation
تعداد نتایج: 485425 فیلتر نتایج به سال:
The present study is an attempt to propose a mutation-based real-coded genetic algorithm (MBRCGA) for sizing and layout optimization of planar and spatial truss structures. The Gaussian mutation operator is used to create the reproduction operators. An adaptive tournament selection mechanism in combination with adaptive Gaussian mutation operators are proposed to achieve an effective search in ...
This work proposes Adaptive Facilitated Mutation, a self-adaptive mutation method for Structured Grammatical Evolution (SGE), biologically inspired by the theory of facilitated variation. In SGE, genotype individuals contains list each non-terminal grammar that defines search space. our proposed mutation, individual an array with different, rate non-terminal. We also propose Function Grouped Gr...
Genetic Algorithms are stochastic optimization methods where solution candidates, complying to a specific problem representation, evaluated according predefined fitness function. These approaches can provide solutions in various tasks even, analytic not be or too complex computed. In this paper we will show, how certain set of problems partially solvable allowing us grade segments individually,...
An efficient method for scattering Genetic Algorithm (GA) individuals in the design space is proposed to accelerate airfoil shape optimization. The method used here is based on the variation of the mutation rate for each gene of the chromosomes by taking feedback from the current population. An adaptive method for airfoil shape parameterization is also applied and its impact on the optimum desi...
Abstract The adaptation of mutation rate parameter values is important to allow the search process to optimize its performance during run time. In addition it frees the user of the need to make non-trivial decisions beforehand. Contrary to real vector coded genotypes, for discrete genotypes most users still prefer to use a fixed mutation rate. Here we propose two simple adaptive mutation rate c...
The theory of evolutionary algorithms on continuous space gravitates around the evolution strategy with one individual, adaptive mutation and elitist selection, optimizing symmetric, quadratic SPHERE function. classic, normal consists three main building-blocks: i) a two-term formula for local (constant mutation) expected progress; ii) an exponential global behavior (adaptive algorithm; iii) li...
in this paper, an adaptive neuro fuzzy sliding mode based genetic algorithm (anfsga) controlsystem is proposed for a ph neutralization system. in ph reactors, determination and control of ph isa common problem concerning chemical-based industrial processes due to the non-linearity observedin the titration curve. an anfsga control system is designed to overcome the complexity of precisecontrol o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید