scholarly journals Adaptive Continuous Mutation Model Genetic Algorithm

2021 ◽  
Author(s):  
Melih Can
Keyword(s):  
Genetic Algorithm ◽  
Adaptive Mutation ◽  
Mutation Model

booste geentic algorithm with continuous adaptive mutation

scholarly journals Adaptive Continuous Mutation Model Genetic Algorithm

2021 ◽  
Author(s):  
Melih Can
Keyword(s):  
Genetic Algorithm ◽  
Adaptive Mutation ◽  
Mutation Model

booste geentic algorithm with continuous adaptive mutation

The Optimal Design on Connection Order of Network in Hydraulic Manifold Block

2011 ◽  
Vol 201-203 ◽  
pp. 2190-2194
Author(s):  
Jun Jun Zhang ◽  
Ji Sheng Wang ◽  
Jiang Yong Wang ◽  
Gang Liu ◽  
Jie Wang
Keyword(s):  
Genetic Algorithm ◽  
Optimal Design ◽  
Genetic Manipulation ◽  
Optimal Algorithm ◽  
Single Point ◽  
Adaptive Mutation ◽  
Gene Encoding ◽  
Mutation Strategy ◽  
The Common

As one of the important questions in the design of hydraulic manifold block — connection order of network, give a solution based on genetic algorithm. Genetic algorithm is the common effective intelligent optimal algorithm and suitable for solving a large combinatorial optimal problems. Gene encoding of ordinal representation, single-point crossover strategy and adaptive mutation strategy are used in the design of genetic manipulation.

scholarly journals An Enhanced Genetic Algorithm for Parameter Estimation of Sinusoidal Signals

2020 ◽  
Vol 10 (15) ◽  
pp. 5110
Author(s):  
Chao Jiang ◽  
Pruthvi Serrao ◽  
Mingjie Liu ◽  
Chongdu Cho
Keyword(s):  
Genetic Algorithm ◽  
Fundamental Problem ◽  
Cloud Model ◽  
Real Life ◽  
Cuckoo Search ◽  
Population Diversity ◽  
Adaptive Mutation ◽  
Parameter Estimations ◽  
Mutation Strategy ◽  
Sinusoidal Signals

Estimating the parameters of sinusoidal signals is a fundamental problem in signal processing and in time-series analysis. Although various genetic algorithms and their hybrids have been introduced to the field, the problems pertaining to complex implementation, premature convergence, and accuracy are still unsolved. To overcome these drawbacks, an enhanced genetic algorithm (EGA) based on biological evolutionary and mathematical ecological theory is originally proposed in this study; wherein a prejudice-free selection mechanism, a two-step crossover (TSC), and an adaptive mutation strategy are designed to preserve population diversity and to maintain a synergy between convergence and search ability. In order to validate the performance, benchmark function-based studies are conducted, and the results are compared with that of the standard genetic algorithm (SGA), the particle swarm optimization (PSO), the cuckoo search (CS), and the cloud model-based genetic algorithm (CMGA). The results reveal that the proposed method outperforms the others in terms of accuracy, convergence speed, and robustness against noise. Finally, parameter estimations of real-life sinusoidal signals are performed, validating the superiority and effectiveness of the proposed method.

scholarly journals A novel pseudoderivative-based mutation operator for real-coded adaptive genetic algorithms

F1000Research ◽  
2013 ◽  
Vol 2 ◽  
pp. 139
Author(s):  
Maxinder S Kanwal ◽  
Avinash S Ramesh ◽  
Lauren A Huang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Mutation Rate ◽  
Optimal Solution ◽  
Global Optimum ◽  
Optimization Techniques ◽  
Adaptive Mutation ◽  
Local Optima ◽  
3 Dimensional ◽  
Successive Generations

Recent development of large databases, especially those in genetics and proteomics, is pushing the development of novel computational algorithms that implement rapid and accurate search strategies. One successful approach has been to use artificial intelligence and methods, including pattern recognition (e.g. neural networks) and optimization techniques (e.g. genetic algorithms). The focus of this paper is on optimizing the design of genetic algorithms by using an adaptive mutation rate that is derived from comparing the fitness values of successive generations. We propose a novel pseudoderivative-based mutation rate operator designed to allow a genetic algorithm to escape local optima and successfully continue to the global optimum. Once proven successful, this algorithm can be implemented to solve real problems in neurology and bioinformatics. As a first step towards this goal, we tested our algorithm on two 3-dimensional surfaces with multiple local optima, but only one global optimum, as well as on the N-queens problem, an applied problem in which the function that maps the curve is implicit. For all tests, the adaptive mutation rate allowed the genetic algorithm to find the global optimal solution, performing significantly better than other search methods, including genetic algorithms that implement fixed mutation rates.

A Dynamic Genetic Algorithm for Clustering Problems

2013 ◽  
Vol 411-414 ◽  
pp. 1884-1893
Author(s):  
Yong Chun Cao ◽  
Ya Bin Shao ◽  
Shuang Liang Tian ◽  
Zheng Qi Cai
Keyword(s):  
Genetic Algorithm ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Real Life ◽  
Search Space ◽  
Adaptive Mutation ◽  
Data Sets ◽  
Data Set ◽  
Local Optima ◽  
Clustering Problems

Due to many of the clustering algorithms based on GAs suffer from degeneracy and are easy to fall in local optima, a novel dynamic genetic algorithm for clustering problems (DGA) is proposed. The algorithm adopted the variable length coding to represent individuals and processed the parallel crossover operation in the subpopulation with individuals of the same length, which allows the DGA algorithm clustering to explore the search space more effectively and can automatically obtain the proper number of clusters and the proper partition from a given data set; the algorithm used the dynamic crossover probability and adaptive mutation probability, which prevented the dynamic clustering algorithm from getting stuck at a local optimal solution. The clustering results in the experiments on three artificial data sets and two real-life data sets show that the DGA algorithm derives better performance and higher accuracy on clustering problems.

Multi-point optimization of transonic airfoils using an enhanced genetic algorithm

2017 ◽  
Vol 232 (7) ◽  
pp. 1347-1360 ◽  
Author(s):  
Narjes Timnak ◽  
Alireza Jahangirian
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Fitness Function ◽  
Single Point ◽  
Navier Stokes ◽  
Computational Time ◽  
Adaptive Mutation ◽  
Function Evaluation ◽  
New Techniques ◽  
New Methods

In this study, two new techniques are proposed for accelerating the multi-point optimization of an airfoil shape by genetic algorithms. In such multi-point evolutionary optimization, the objective function has to be evaluated several times more than a single-point optimization. Thus, excessive computational time is crucial in these problems particularly, when computational fluid dynamics is used for fitness function evaluation. Two new techniques of preadaptive range operator and adaptive mutation rate are proposed. An unstructured grid Navier–Stokes flow solver with a two-equation [Formula: see text] turbulence model is used to evaluate the objective function. The new methods are applied for optimum design of a transonic airfoil at two speed conditions. The results show that using the new methods can increase the aerodynamic efficiency of optimum airfoil at each operating condition with about 30% less computational time in comparison with the conventional genetic algorithm approach.

Sign in / Sign up

Export Citation Format

Share Document