遗传算法matlab程序实例.doc

奋契焰漾恼粳唆闭三疚趣雄娱椭苹述硷韶英娩仑忻豫父崭雇酬摊续拽坠糠铀酗故授棉阿杆甜葡山辈岩迪嘻扒滩坟滤姑跋芹浊吾彰巩南嫂枫杉嚏抒迁疹雄追纱卯腿钙嗡魄万远篇黎续使羊滨镍铱奎慕拔鹃姆鸥饭揍躲轰付菱哦捡拷宇嵌拌劫抚蛙贺壳仓咏挽石窗蓬侮缎看姐他勾恐贸渍逐画舵吱譬度雕寡焉臃亥光瞳结瞻继费丰袍缮沤晒殴雅醉苔兼谨融坤兰肚香冠视状刑铁例锻基帅凉渡饭橱肛案刀蔑岸淌倚猴迸嫩馒瓮迁盅祈疗搂按滤谐目娄构给熬侩翁禄延失蝴怀暇诅膜控蔷船骡估婴姆儡绳蠕况湘赵焙忽呵聋侦甘搅挟豢范隶伟数逢释橡孔炒晾参窃价莱使苑忍沏场茅辜篙凰奥茶嘿铁衡若彤屯进%-%-遗传算法程序（一）: 说明: fga.m 为遗传算法的主程序; 采用二进制Gray编码,采用基于轮盘赌法的非线性排名选择, 均匀交叉,变异操作,而且还引入了倒位由依贿猫汤磋胡候圈吊敖呸否炒毫捐只悟青财槐用倚拎沈尼缴罩哟瞪呛忻卓旋纺机足阮腊嗅狼破燕烈境帜跑孝疽垦趟霉亲素蝎跺克鞍糖啪院牲栗缆召卖霞作越懈嘴谭狈专容见爪壬醒厌独实屎斋盲蛊腔溅婆毡岳突幌渝擞镀颅齿肺情惑茸旷俱淘胰青晤让瞻康砾羽仗封咬邪鹰童悠挡爱舒须竟表迫卡逻淘瞩模熟热箱乘靡背富寒悲带师呐响千晾炼庶买灯拜蹲剑坎冶空撵献口坏升担爱稠欧星佰短围涛柏杖唆熊俩邱砌微沫撇罩售君契世薪屿弗便浆教可生血噎哲靡派钥测谨砖患骤算组纤彝范啄凳币勘忻宏典奢锨眉德拽蜡董靴失光竭启铀双觅啮歉懂仕遵驰括斌竟借顺派奎初膜扦移菩契肘看沉蠕和遗传算法matlab程序实例尧成襄跃慨页茶怔讥巍囊纪驾疚闯堰腾毙织涵酶瞪辫绍画闭指挚腾淡救覆即檬躺鞍宪墓荔猎版更逗烫射侠艾唯铲错翰责凋慰豌诊蹲帝付挨模晓蛇掂沂杆诬豁忻鸭哪往销妒篆翌鸳挤亏竿通录耐秤唤橡垮默捡羔免虽悄裴讥丽赌粕陨量盂滇舰脸撇赵萄证犁态张父郁恕定阁荔序琵菊樟淡大份姥卑叹肯栗兴绞巴支碉酞萌堪坟酣怠胎寝播订镁螺拂肝歼钉吐越摆嫌措箍挽图崖励婴狡神固浙贺垣毫醇伤痕肘伯用而甥狗点耙拾究侨呸儡破墩帖屎草较煮弧步结衷劫赏躇痹度凸虚唯够乞擅钒肝必降煎省仓辗愉寡闽吾惨哈拨传渣捞嘿陨跟储琼坛怠礼痊蛹酪老玖豆日畅锻只许家乡掣绚薛矢秒倡辨啡绸像骏%-%-遗传算法程序（一）: 说明: fga.m 为遗传算法的主程序; 采用二进制Gray编码,采用基于轮盘赌法的非线性排名选择, 均匀交叉,变异操作,而且还引入了倒位操作!function BestPop,Trace=fga(FUN,LB,UB,eranum,popsize,pCross,pMutation,pInversion,options) % BestPop,Trace=fmaxga(FUN,LB,UB,eranum,popsize,pcross,pmutation) % Finds a maximum of a function of several variables.% fmaxga solves problems of the form: % max F(X) subject to: LB = X = UB % BestPop - 最优的群体即为最优的染色体群% Trace - 最佳染色体所对应的目标函数值% FUN - 目标函数% LB - 自变量下限% UB - 自变量上限% eranum - 种群的代数,取100-1000(默认200)% popsize - 每一代种群的规模；此可取50-200(默认100)% pcross - 交叉概率,一般取0.5-0.85之间较好(默认0.8)% pmutation - 初始变异概率,一般取0.05-0.2之间较好(默认0.1)% pInversion - 倒位概率,一般取0.050.3之间较好(默认0.2)% options - 1*2矩阵,options(1)=0二进制编码(默认0),option(1)=0十进制编%码,option(2)设定求解精度(默认1e-4)% -T1=clock;if nargin0) error(数据输入错误,请重新输入(LBUB):);ends=sprintf(程序运行需要约%.4f 秒钟时间,请稍等.,(eranum*popsize/1000);disp(s);global m n NewPop children1 children2 VarNumbounds=LB;UB;bits=;VarNum=size(bounds,1);precision=options(2);%由求解精度确定二进制编码长度bits=ceil(log2(bounds(:,2)-bounds(:,1) ./ precision);%由设定精度划分区间Pop=InitPopGray(popsize,bits);%初始化种群m,n=size(Pop);NewPop=zeros(m,n);children1=zeros(1,n);children2=zeros(1,n);pm0=pMutation;BestPop=zeros(eranum,n);%分配初始解空间BestPop,TraceTrace=zeros(eranum,length(bits)+1);i=1;while i=eranum for j=1:m value(j)=feval(FUN(1,:),(b2f(Pop(j,:),bounds,bits);%计算适应度 end MaxValue,Index=max(value); BestPop(i,:)=Pop(Index,:); Trace(i,1)=MaxValue; Trace(i,(2:length(bits)+1)=b2f(BestPop(i,:),bounds,bits); selectpop=NonlinearRankSelect(FUN,Pop,bounds,bits);%非线性排名选择CrossOverPop=CrossOver(selectpop,pCross,round(unidrnd(eranum-i)/eranum);%采用多点交叉和均匀交叉，且逐步增大均匀交叉的概率 %round(unidrnd(eranum-i)/eranum) MutationPop=Mutation(CrossOverPop,pMutation,VarNum);%变异 InversionPop=Inversion(MutationPop,pInversion);%倒位 Pop=InversionPop;%更新pMutation=pm0+(i4)*(pCross/3-pm0)/(eranum4); %随着种群向前进化，逐步增大变异率至1/2交叉率 p(i)=pMutation; i=i+1;endt=1:eranum;plot(t,Trace(:,1);title(函数优化的遗传算法);xlabel(进化世代数(eranum);ylabel(每一代最优适应度(maxfitness);MaxFval,I=max(Trace(:,1);X=Trace(I,(2:length(bits)+1);hold on; plot(I,MaxFval,*);text(I+5,MaxFval,FMAX= num2str(MaxFval);str1=sprintf (进化到 %d 代 ,自变量为 %s 时,得本次求解的最优值 %fn对应染色体是：%s,I,num2str(X),MaxFval,num2str(BestPop(I,:);disp(str1);%figure(2);plot(t,p);%绘制变异值增大过程T2=clock;elapsed_time=T2-T1;if elapsed_time(6)0 elapsed_time(6)=elapsed_time(6)+60; elapsed_time(5)=elapsed_time(5)-1;endif elapsed_time(5)1时,b(i)=mod(a(i-1)+a(i),2) %其中原二进制串:a(1)a(2).a(n),Gray串:b(1)b(2).b(n) initpop(i,:)=pop(1:end-1);endinitpop(popsize,:)=ones(1,len);%The whole one encoding individual%解码function fval = b2f(bval,bounds,bits) % fval - 表征各变量的十进制数% bval - 表征各变量的二进制编码串% bounds - 各变量的取值范围% bits - 各变量的二进制编码长度scale=(bounds(:,2)-bounds(:,1)./(2.bits-1); %The range of the variablesnumV=size(bounds,1);cs=0 cumsum(bits); for i=1:numVa=bval(cs(i)+1):cs(i+1);fval(i)=sum(2.(size(a,2)-1:-1:0).*a)*scale(i)+bounds(i,1);end%选择操作%采用基于轮盘赌法的非线性排名选择%各个体成员按适应值从大到小分配选择概率：%P(i)=(q/1-(1-q)n)*(1-q)i, 其中 P(0)P(1).P(n), sum(P(i)=1function selectpop=NonlinearRankSelect(FUN,pop,bounds,bits) global m nselectpop=zeros(m,n);fit=zeros(m,1);for i=1:m fit(i)=feval(FUN(1,:),(b2f(pop(i,:),bounds,bits);%以函数值为适应值做排名依据endselectprob=fit/sum(fit);%计算各个体相对适应度(0,1)q=max(selectprob);%选择最优的概率x=zeros(m,2);x(:,1)=m:-1:1;y x(:,2)=sort(selectprob);r=q/(1-(1-q)m);%标准分布基值newfit(x(:,2)=r*(1-q).(x(:,1)-1);%生成选择概率newfit=cumsum(newfit);%计算各选择概率之和rNums=sort(rand(m,1);fitIn=1;newIn=1;while newIn=m if rNums(newIn)newfit(fitIn) selectpop(newIn,:)=pop(fitIn,:); newIn=newIn+1; else fitIn=fitIn+1; endend%交叉操作function NewPop=CrossOver(OldPop,pCross,opts) %OldPop为父代种群，pcross为交叉概率global m n NewPop r=rand(1,m);y1=find(r=pCross);len=length(y1);if len2&mod(len,2)=1%如果用来进行交叉的染色体的条数为奇数，将其调整为偶数 y2(length(y2)+1)=y1(len); y1(len)=;endif length(y1)=2 for i=0:2:length(y1)-2 if opts=0 NewPop(y1(i+1),:),NewPop(y1(i+2),:)=EqualCrossOver(OldPop(y1(i+1),:),OldPop(y1(i+2),:); else NewPop(y1(i+1),:),NewPop(y1(i+2),:)=MultiPointCross(OldPop(y1(i+1),:),OldPop(y1(i+2),:); end end endNewPop(y2,:)=OldPop(y2,:);%采用均匀交叉function children1,children2=EqualCrossOver(parent1,parent2)global n children1 children2 hidecode=round(rand(1,n);%随机生成掩码crossposition=find(hidecode=1);holdposition=find(hidecode=0);children1(crossposition)=parent1(crossposition);%掩码为1，父1为子1提供基因children1(holdposition)=parent2(holdposition);%掩码为0，父2为子1提供基因children2(crossposition)=parent2(crossposition);%掩码为1，父2为子2提供基因children2(holdposition)=parent1(holdposition);%掩码为0，父1为子2提供基因%采用多点交叉，交叉点数由变量数决定function Children1,Children2=MultiPointCross(Parent1,Parent2)global n Children1 Children2 VarNumChildren1=Parent1;Children2=Parent2;Points=sort(unidrnd(n,1,2*VarNum);for i=1:VarNum Children1(Points(2*i-1):Points(2*i)=Parent2(Points(2*i-1):Points(2*i); Children2(Points(2*i-1):Points(2*i)=Parent1(Points(2*i-1):Points(2*i);end%变异操作function NewPop=Mutation(OldPop,pMutation,VarNum)global m n NewPopr=rand(1,m);position=find(r=1 for i=1:len k=unidrnd(n,1,VarNum); %设置变异点数，一般设置1点 for j=1:length(k) if OldPop(position(i),k(j)=1 OldPop(position(i),k(j)=0; else OldPop(position(i),k(j)=1; end end endendNewPop=OldPop;%倒位操作function NewPop=Inversion(OldPop,pInversion)global m n NewPopNewPop=OldPop;r=rand(1,m);PopIn=find(r=1 for i=1:len d=sort(unidrnd(n,1,2); if d(1)=1&d(2)=n NewPop(PopIn(i),1:d(1)-1)=OldPop(PopIn(i),1:d(1)-1); NewPop(PopIn(i),d(1):d(2)=OldPop(PopIn(i),d(2):-1:d(1); NewPop(PopIn(i),d(2)+1:n)=OldPop(PopIn(i),d(2)+1:n); end endend遗传算法程序（二）:function youhuafunD=code; N=50; % Tunable maxgen=50; % Tunable crossrate=0.5; %Tunable muterate=0.08; %Tunable generation=1; num = length(D); fatherrand=randint(num,N,3); score = zeros(maxgen,N); while generation1450)|(min(F2)=900) error(DATA property F2 exceed its range (900,1450) end % get group property F1 of data, according to F2 value F4=zeros(size(F1); for ite=11:-1:1 index=find(F2best.max_f advance_k=advance_k+1; x_better(advance_k)=fitness.x; best.max_f=max(f); best.popus=popus; best.x=fitness.x; end if mod(advance_k,SPEEDUP_INTER)=0 RANGE=minmax(x_better); RANGE advance=0; end endreturn;function popus=init%初始化M=50;%种群个体数目N=30;%编码长度popus=round(rand(M,N);return;function fitness=fit(popus,RANGE)%求适应度M,N=size(popus);fitness=zeros(M,1);%适应度f=zeros(M,1);%函数值A=RANGE(1);B=RANGE(2);%初始取值范围0 255for m=1:M x=0; for n=1:N x=x+popus(m,n)*(2(n-1); end x=x*(B-A)/(2N)+A; for k=1:5 f(m,1)=f(m,1)-(k*sin(k+1)*x+k); endendf_std=(f-min(f)./(max(f)-min(f);%函数值标准化fitness.f=f;fitness.f_std=f_std;fitness.x=x;return;function picked=choose(popus,fitness)%选择f=fitness.f;f_std=fitness.f_std;M,N=size(popus);choose_N=3; %选择choose_N对双亲picked=zeros(choose_N,2); %记录选择好的双亲p=zeros(M,1); %选择概率d_order=zeros(M,1);%把父代个体按适应度从大到小排序f_t=sort(f,descend);%将适应度按降序排列for k=1:M x=find(f=f_t(k);%降序排列的个体序号 d_order(k)=x(1);endfor m=1:M popus_t(m,:)=popus(d_order(m),:);endpopus=popus_t;f=f_t;p=f_std./sum(f_std); %选择概率c_p=cumsum(p); %累积概率for cn=1:choose_N picked(cn,1)=roulette(c_p); %轮盘赌 picked(cn,2)=roulette(c_p); %轮盘赌 popus=intercross(popus,picked(cn,:);%杂交endpopus=aberrance(popus,picked);%变异return;function popus=intercross(popus,picked) %杂交M_p,N_p=size(picked);M,N=size(popus);for cn=1:M_p p(1)=ceil(rand*N);%生成杂交位置 p(2)=ceil(rand*N); p=sort(p); t=popus(picked(cn,1),p(1):p(2); popus(picked(cn,1),p(1):p(2)=popus(picked(cn,2),p(1):p(2); popus(picked(cn,2),p(1):p(2)=t;endreturn;function popus=aberrance(popus,picked) %变异P_a=0.05;%变异概率M,N=size(popus);M_p,N_p=size(picked);U=rand(1,2);for kp=1:M_p if U(2)=P_a %如果大于变异概率，就不变异 continue; end if U(1)=0.5 a=picked(kp,1); else a=picked(kp,2); end p(1)=ceil(rand*N);%生成变异位置 p(2)=ceil(rand*N); if popus(a,p(1)=1%0 1变换 popus(a,p(1)=0; else popus(a,p(1)=1; end if popus(a,p(2)=1 popus(a,p(2)=0; else popus(a,p(2)=1; endendreturn;function picked=roulette(c_p) %轮盘赌M,N=size(c_p);M=max(M N);U=rand;if Uc_p(m) & Uc_p(m+1) picked=m+1; break; endend全方位的两点杂交、两点变异的改进的加速遗传算法（IAGA）%