180 likes | 418 Views
A Study of Mutation Methods for Evolutionary Algorithms. Andreas Koenig December 6, 2002 CS 447- Advanced Topics in Artificial Intelligence. Objective. Find a mutation operator to quickly converge to local minimum (maximum)
E N D
A Study of Mutation Methods for Evolutionary Algorithms Andreas Koenig December 6, 2002 CS 447- Advanced Topics in Artificial Intelligence
Objective • Find a mutation operator to quickly converge to local minimum (maximum) • Introduce and compare the effectiveness of various types of mutation operators for evolutionary algorithms • Apply one of these mutation operators to maximize the output current of an automotive alternator
Evolutionary Algorithms 1. Create Population 2. Evaluate Fitness 4. Recombine Parents (Optional) 3. Select Parents 5. Mutate Offspring 6. Evaluate Offspring 7. Select New Population
5. Mutate Offspring • Combination of Evolutionary Strategies (ES) & Evolutionary Programming (EP) • Fundamental Equations: • where: • n = number of x’s in member • D = random number • N(0,1) = Gaussian random number with mean = 0, variance = 1
Mutation Operators • Random Distributions: • Gaussian • Classical Evolutionary Programming (CEP) • Cauchy • Fast Evolutionary Programming (FEP) • Xin Yao and Yong Liu • Combined Gaussian-Cauchy • Mean Mutation Operator (MMO) • Adaptive Mean Mutation Operator (AMMO) • Kumar Chellapilla • Adaptive Lévy • Chang-Yong Lee and Xin Yao
Mutation Operator: Gaussian (CEP) • Gaussian Probability Density Function:
Mutation Operator: Cauchy (FEP) • Cauchy Probability Density Function:
Mutation Operator: Combined Gaussian & Cauchy (MMO,AMMO) • Mean Mutation Operator (MMO) Mutation Procedure: • Adaptive Mean Mutation Operator (AMMO) Mutation Procedure:
Mutation Operator: Adaptive Lévy • Lévy Probability Density Function: • Mutation Procedure Changes: • 4 offspring created from each parent using α = 1.0, 1.3, 1.7 and 2.0 • Most fit offspring is chosen for competition • ¼ Population is used to help match computational time of other methods
Mutation Operator: Adaptive Lévy • Lévy Probability Density Function:
Experimental Parameters • Same initial population was used for each run of a given function
Results • FEP, MMO and AMMO are generally fastest
Rotor Tip Height Rotor Tip Width Machine Optimization • Claw Pole Alternator: • Maximize DC Output Current • Machine Parameters
Machine Optimization Results • FEP Parameters