运用MATLAB实现遗传算法求解规划问题资源.docVIP

function[BestPop,Trace]=fga(FUN,LB,UB,eranum,popsize,pCross,pMutation,pInversion,options)

%[BestPop,Trace]=fmaxga(FUN,LB,UB,eranum,popsize,pcross,pmutation)

%Findsamaximumofafunctionofseveralvariables.

%fmaxgasolvesproblemsoftheform:

%maxF(X)subjectto: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.05－0.3之间较好(默认0.2)

%options-1*2矩阵,options(1)=0二进制编码(默认0),option(1)~=0十进制编

%码,option(2)设定求解精度(默认1e-4)

%

%------------------------------------------------------------------------

T1=clock;

ifnargin3,error(FMAXGArequiresatleastthreeinputarguments);end

ifnargin==3,eranum=200;popsize=100;pCross=0.8;pMutation=0.1;pInversion=0.15;options=[01e-4];end

ifnargin==4,popsize=100;pCross=0.8;pMutation=0.1;pInversion=0.15;options=[01e-4];end

ifnargin==5,pCross=0.8;pMutation=0.1;pInversion=0.15;options=[01e-4];end

ifnargin==6,pMutation=0.1;pInversion=0.15;options=[01e-4];end

ifnargin==7,pInversion=0.15;options=[01e-4];end

iffind((LB-UB)0)

error(数据输入错误,请重新输入(LBUB):);

end

s=sprintf(程序运行需要约%.4f秒钟时间,请稍等......,(eranum*popsize/1000));

disp(s);

globalmnNewPopchildren1children2VarNum

bounds=[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,Trace

Trace=zeros(eranum,length(bits)+1);

i=1;

whilei=eranum

forj=1:m

g=b2f(Pop(j,:),bounds,bits);

value(j)=feval(FUN,g(1),g(2));%计算适应度

end

[MaxValue,Index]=max(va