遺傳算法matlab實現(xiàn)源程序

1、標準實用附頁：一遺傳算法源程序：clc;clear;population;%評價目標函數(shù)值for uim=1:popsizevector=population(uim,:);obj(uim)=hanshu(hromlength,vector,phen);end%obj%min(obj)文案大全標準實用clear uim;objmin=min(obj);for sequ=1:popsizeif obj(sequ)=objminopti=population(sequ,:);endendclear sequ;fmax=22000;%=for gen=1:maxgen%選擇操作%將求最小值的函數(shù)轉(zhuǎn)化

2、為適應度函數(shù)for indivi=1:popsizeobj1(indivi)=1/obj(indivi);endclear indivi;%適應度函數(shù)累加總合total=0;for indivi=1:popsizetotal=total+obj1(indivi);endclear indivi;%每條染色體被選中的幾率文案大全標準實用for indivi=1:popsizefitness1(indivi)=obj1(indivi)/total;endclear indivi;%各條染色體被選中的范圍for indivi=1:popsizefitness(indivi)=0;for j=1:in

3、divifitness(indivi)=fitness(indivi)+fitness1(j);endendclear j;fitness;%選擇適應度高的個體for ranseti=1:popsizeran=rand;while (ran>1|ran<0)ran=rand;endran;if ran<=fitness(1)newpopulation(ranseti,:)=population(1,:);elsefor fet=2:popsizeif (ran>fitness(fet-1)&&(ran<=fitness(fet)文案大全標準實用ne

4、wpopulation(ranseti,:)=population(fet,:);endendendendclear ran;newpopulation;%交叉for int=1:2:popsize-1popmoth=newpopulation(int,:);popfath=newpopulation(int+1,:);popcross(int,:)=popmoth;popcross(int+1,:)=popfath;randnum=rand;if(randnum< P>cpoint1=round(rand*hromlength);cpoint2=round(rand*hromle

5、ngth);while (cpoint2=cpoint1)cpoint2=round(rand*hromlength);endif cpoint1>cpoint2tem=cpoint1;cpoint1=cpoint2;cpoint2=tem;文案大全標準實用endcpoint1;cpoint2;for term=cpoint1+1:cpoint2for ss=1:hromlengthif popcross(int,ss)=popfath(term)tem1=popcross(int,ss);popcross(int,ss)=popcross(int,term);popcross(int,

6、term)=tem1;endendclear tem1;endfor term=cpoint1+1:cpoint2for ss=1:hromlengthif popcross(int+1,ss)=popmoth(term)tem1=popcross(int+1,ss);popcross(int+1,ss)=popcross(int+1,term);popcross(int+1,term)=tem1;endendclear tem1;endend文案大全標準實用clear term;endclear randnum;popcross;%變異操作newpop=popcross;for int=1:

7、popsizerandnum=rand;if randnumcpoint12=round(rand*hromlength);cpoint22=round(rand*hromlength);if (cpoint12=0)cpoint12=1;endif (cpoint22=0)cpoint22=1;endwhile (cpoint22=cpoint12)cpoint22=round(rand*hromlength);if cpoint22=0;cpoint22=1;endendtemp=newpop(int,cpoint12);文案大全標準實用newpop(int,cpoint12)=newpo

8、p(int,cpoint22);newpop(int,cpoint22)=temp;endendnewpop;clear cpoint12;clear cpoint22;clear randnum;clear int;for ium=1:popsizevector1=newpop(ium,:);obj1(ium)=hanshu(hromlength,vector1,phen);endclear ium;obj1max=max(obj1);for ar=1:popsizeif obj1(ar)=obj1maxnewpop(ar,:)=opti;endend%遺傳操作結(jié)束二粒子群算法源程序：%-初

9、始格式化 -clear all;文案大全標準實用clc;format long;%-給定初始化條件-c1=1.4962;% 學習因子 1c2=1.4962;% 學習因子 2w=0.7298;%慣性權(quán)重MaxDT=100;%最大迭代次數(shù)D=2;%搜索空間維數(shù)（未知數(shù)個數(shù)）N=40;%初始化群體個體數(shù)目eps=10(-6);%設(shè)置精度 ( 在已知最小值時候用)%-初始化種群的個體( 可以在這里限定位置和速度的范圍)-for i=1:Nfor j=1:Dx(i,j)=randn;%隨機初始化位置v(i,j)=randn;%隨機初始化速度endend%-先計算各個粒子的適應度，并初始化Pi 和 Pg-

10、for i=1:Np(i)=fitness(x(i,:),D);y(i,:)=x(i,:);endpg=x(1,:);%Pg為全局最優(yōu)for i=2:N文案大全標準實用if fitness(x(i,:),D)<FITNESS(pg,D)pg=x(i,:);endend%-進入主要循環(huán)，按照公式依次迭代，直到滿足精度要求-for t=1:MaxDTtfor i=1:Nv(i,:)=w*v(i,:)+c1*rand*(y(i,:)-x(i,:)+c2*rand*(pg-x(i,:);x(i,:)=x(i,:)+v(i,:);if fitness(x(i,:),D)<p(i)p(i)=f

11、itness(x(i,:),D);y(i,:)=x(i,:);endif p(i)<FITNESS(pg,D)pg=y(i,:);endendPbest(t)=fitness(pg,D);end%-進入主要循環(huán)，按照公式依次迭代，直到滿足精度要求-for t=1:MaxDTfor i=1:Nv(i,:)=w*v(i,:)+c1*rand*(y(i,:)-x(i,:)+c2*rand*(pg-x(i,:);文案大全標準實用x(i,:)=x(i,:)+v(i,:);if fitness(x(i,:),D)<p(i)p(i)=fitness(x(i,:),D);y(i,:)=x(i,:);endif p(i)<FITNESS(pg,D)pg=y(i,:);endendPbest(t)=fitness(pg,D);end%-最后給出計算結(jié)果disp('*')disp('函數(shù)的全局最優(yōu)位置為：')Solution=pg'disp(&