智能算法分析报告.pptVIP

* How to explore points near the global minimum One way to make the genetic algorithm explore a wider range of points — that is, to increase the diversity of the populations — is to increase the Initial range. * Range of individuals in each generation a much wider range of individuals. By the second generation there are individuals greater than 21, and by generation 12, the algorithm finds a best individual that is approximately equal to 21. all individuals are between -2 and 2.5. While this range is larger than the default Initial range of [0;1], due to mutation, it is not large enough to explore points near the global minimum at x = 21. * Ex2: Constrained Minimization Using GA minimize a simple fitness function of two variables x1 and x2 min f(x) = 100 * (x1^2 - x2) ^2 + (1 - x1)^2; x the following two nonlinear constraints and bounds are satisfied x1*x2 + x1 - x2 + 1.5 =0, (nonlinear constraint) 10 - x1*x2 =0, (nonlinear constraint) 0 = x1 = 1, and (bound) 0 = x2 = 13 (bound) * Define of objective function and constrains function [c, ceq] = simple_constraint(x) c = [1.5 + x(1)*x(2) + x(1) - x(2); -x(1)*x(2) + 10]; ceq = []; function y = simple_fitness(x) y = 100 * (x(1)^2 - x(2)) ^2 + (1 - x(1))^2; 0 = x1 = 1 0 = x2 = 13 * Result of Ex2 * M-file Generated by GATool function [X,FVAL,REASON,OUTPUT,POPULATION,SCORES] = cm_ga %%Fitness function fitnessFunction = @simple_fitness; %%Number of Variables nvars = 2 ; %Linear inequality constraints Aineq = [];Bineq = []; %Linear equality constraints Aeq = [];Beq = []; %Bounds LB = [0 0 ];UB = [1 13 ]; %Nonlinear constraints nonlconFunction = @simple_constraint; %Start with default options options = gaoptimset; %%Modify some parameters options = gaoptimset(options,PopulationSize ,100); options = gaoptimset(options,MutationFcn ,{ @mutationgaussian 1 1 }); options = gaoptimset(options,Display ,off); %%Run GA [X,FVAL,REASON,OUTPUT,POPULATIO