启发式算法精要.ppt

gatool Fitness function：@ackleyfcn Number of variables：10 选中‘Plots’中的‘Best fitness’ X = gamultipoj(fitnessfcn,nvars,A,b,Aeq,beq,lb,ub,options) 可以处理线性不等式约束、线性等式约束和有界约束 解多目标规划 function y = simple_multiobjective(x) y(1) = (x+2)^2 - 10; y(2) = (x-2)^2 + 20; FitnessFunction = @simple_multiobjective; numberOfVariables = 1; [x,fval] = gamultiobj(FitnessFunction,numberOfVariables); Optimization terminated: average change in the spread of Pareto solutions less than options.TolFun. size(x) ans = 15 1 size(fval) ans = 15 2 4.4 遗传算法对TSP的应用 load(usborder.mat,x,y,xx,yy); plot(x,y,Color,red); hold on; cities = 40; locations = zeros(cities,2); n = 1; while (n = cities) xp = rand*1.5; yp = rand; if inpolygon(xp,yp,xx,yy) locations(n,1) = xp; locations(n,2) = yp; n = n+1; end end plot(locations(:,1),locations(:,2),bo); distances = zeros(cities); for count1=1:cities, for count2=1:count1, x1 = locations(count1,1); y1 = locations(count1,2); x2 = locations(count2,1); y2 = locations(count2,2); distances(count1,count2)=sqrt((x1-x2)^2+(y1-y2)^2); distances(count2,count1)=distances(count1,count2); end; end; create_permutations.m crossover_permutation.m mutate_permutation.m traveling_salesman_fitness.m traveling_salesman_plot.m FitnessFcn = @(x) traveling_salesman_fitness(x,distances); my_plot = @(options,state,flag) traveling_salesman_plot(options, state,flag,locations); options = gaoptimset(PopulationType, custom,PopInitRange, [1;cities]); options = gaoptimset(options,CreationFcn,@create_permutations, ... CrossoverFcn,@crossover_permutation, ... MutationFcn,@mutate_permutation, ... PlotFcn, my_plot, ... Generations,500,PopulationSize,60, ... StallGenLimit,200,Vectorized,on); numberOfVariables = cities; [x,fval,reason,output] = ga(FitnessFcn,numberOfVariables,options) Optimization terminated: average change in the fitness value less than options.TolFun. x