Self-adaptive mutation strategy for evolutionary programming based on fitness tracking scheme

2013 ◽  
Author(s):  
Md. Tanvir Alam Anik ◽  
Saif Ahmed ◽  
K. M. Rakibul Islam
Keyword(s):  
Evolutionary Programming ◽  
Adaptive Mutation ◽  
Mutation Strategy ◽  
Fitness Tracking ◽  
Self Adaptive

scholarly journals Optimum sizing of members of truss structures using direct design and a self-adaptive mutationdifferential evolution

2021 ◽  
Vol 63 (2) ◽  
pp. 39-44
Author(s):  
Manh-Hung Ha ◽  
◽  
Hoang-Anh Pham ◽  
Keyword(s):  
Structural Design ◽  
Computational Cost ◽  
Truss Structures ◽  
Adaptive Mutation ◽  
De Algorithm ◽  
Inelastic Analysis ◽  
Local Searches ◽  
Direct Design ◽  
Mutation Strategy ◽  
Self Adaptive

Direct design using nonlinear inelastic analysis has been recently enabled for structural design as this approach can directly predict the behaviour of a structure as a whole, which eliminates capacity checks for individual structural members. However, the use of direct design is often accompanied by excessive computational efforts, especially for complicated structural design problems such as optimization or reliability analysis. In this study, we introduce an efficient method for the sizing optimization of truss structures employing nonlinear inelastic analysis for the direct design of structures. The objective function is the total weight of the structure while the strength and serviceability constraints are evaluated with nonlinear inelastic analysis. To save computational cost, an improved differential evolution (DE) algorithm is employed. Compared to the conventional DE algorithm, the proposed method has two major improvements: (1) a self-adaptive mutation strategy based on the p-best method to enhance the balance between global and local searches and (2) use of the multi-comparison technique (MCT) to reduce redundant structural analyses. The numerical results of a 72-bar truss case study demonstrate that the performance of the proposed method has significant advantages over the traditional DE method.

scholarly journals Mutation Strategy Based on Step Size and Survival Rate for Evolutionary Programming

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Libin Hong ◽  
Chenjian Liu ◽  
Jiadong Cui ◽  
Fuchang Liu
Keyword(s):  
Survival Rate ◽  
Novel Mutation ◽  
Single Point ◽  
Evolutionary Process ◽  
Evolutionary Programming ◽  
Adaptive Mutation ◽  
Single Point Mutation ◽  
Step Size ◽  
Mutation Operators ◽  
Mutation Strategy

Evolutionary programming (EP) uses a mutation as a unique operator. Gaussian, Cauchy, Lévy, and double exponential probability distributions and single-point mutation were nominated as mutation operators. Many mutation strategies have been proposed over the last two decades. The most recent EP variant was proposed using a step-size-based self-adaptive mutation operator. In SSEP, the mutation type with its parameters is selected based on the step size, which differs from generation to generation. Several principles for choosing proper parameters have been proposed; however, SSEP still has limitations and does not display outstanding performance on some benchmark functions. In this work, we proposed a novel mutation strategy based on both the “step size” and “survival rate” for EP (SSMSEP). SSMSEP-1 and SSMSEP-2 are two variants of SSMSEP, which use “survival rate” or “step size” separately. Our proposed method can select appropriate mutation operators and update parameters for mutation operators according to diverse landscapes during the evolutionary process. Compared with SSMSEP-1, SSMSEP-2, SSEP, and other EP variants, the SSMSEP demonstrates its robustness and stable performance on most benchmark functions tested.

scholarly journals Research on the inverse kinematics of manipulator using an improved self-adaptive mutation differential evolution algorithm

2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110144
Author(s):  
Qianqian Zhang ◽  
Daqing Wang ◽  
Lifu Gao
Keyword(s):  
Differential Evolution ◽  
Objective Function ◽  
Inverse Kinematics ◽  
Differential Evolution Algorithm ◽  
Weight Coefficient ◽  
Adaptive Mutation ◽  
Feasible Region ◽  
Serial Manipulators ◽  
De Algorithm ◽  
Self Adaptive

To assess the inverse kinematics (IK) of multiple degree-of-freedom (DOF) serial manipulators, this article proposes a method for solving the IK of manipulators using an improved self-adaptive mutation differential evolution (DE) algorithm. First, based on the self-adaptive DE algorithm, a new adaptive mutation operator and adaptive scaling factor are proposed to change the control parameters and differential strategy of the DE algorithm. Then, an error-related weight coefficient of the objective function is proposed to balance the weight of the position error and orientation error in the objective function. Finally, the proposed method is verified by the benchmark function, the 6-DOF and 7-DOF serial manipulator model. Experimental results show that the improvement of the algorithm and improved objective function can significantly improve the accuracy of the IK. For the specified points and random points in the feasible region, the proportion of accuracy meeting the specified requirements is increased by 22.5% and 28.7%, respectively.

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.

A Novel Discovery Technique on Attribute Weight of Engine CBR Design System

2010 ◽  
Vol 97-101 ◽  
pp. 3714-3717 ◽  
Author(s):  
Wei Yan ◽  
Qi Gao ◽  
Zheng Gang Liu ◽  
Shan Hui Zhang ◽  
Yu Ping Hu
Keyword(s):  
Evolutionary Programming ◽  
Programming Algorithm ◽  
Design System ◽  
Reference Case ◽  
Attribute Weight ◽  
Case Base ◽  
Mutation Strategies ◽  
Group Self ◽  
Gauss Operator ◽  
Self Adaptive

An improved multi-group self-adaptive evolutionary programming Algorithm is used to get adapt attribute weight for CBR system. Firstly, this paper analyses the adaptability function based on reference case base REF and testing case base TEST, develops a novel Bi-group self-adaptive evolutionary programming that overcome the lack of conventional evolutionary programming. In this Novel algorithm, evolution of Cauchy operator and Gauss operator are parallel performed with different mutation strategies, and the Gauss operator owns the ability of self-adaptation according to the variation of adaptability function. Information is exchanged when sub-groups are reorganized. Experiment results prove the validity of self-adaptive Algorithm and CBR design system is used successfully in engine design process.

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.

A Self-Adaptive Mutation Neural Architecture Search Algorithm Based on Blocks

2021 ◽  
Vol 16 (3) ◽  
pp. 67-78
Author(s):  
Yu Xue ◽  
Yankang Wang ◽  
Jiayu Liang ◽  
Adam Slowik
Keyword(s):  
Search Algorithm ◽  
Adaptive Mutation ◽  
Neural Architecture ◽  
Self Adaptive
Sign in / Sign up

Export Citation Format

Share Document