parent
61eaa2ba60
commit
d758ad5005
14
main.m
14
main.m
|
|
@ -7,8 +7,8 @@ snWind=data(:,1:3:end);
|
||||||
snSolar=data(:,2:3:end);
|
snSolar=data(:,2:3:end);
|
||||||
snP=data(:,3:3:end);
|
snP=data(:,3:3:end);
|
||||||
snP(snP==-100)=1;
|
snP(snP==-100)=1;
|
||||||
randSNCount=100; %要小于16^288 。解的场景数量
|
randSNCount=500; %要小于16^288 。解的场景数量
|
||||||
gaCount=100;%粒子数
|
gaCount=20;%粒子数
|
||||||
%% ³õʼ»¯
|
%% ³õʼ»¯
|
||||||
ga=repmat(struct(),gaCount,1);
|
ga=repmat(struct(),gaCount,1);
|
||||||
for I=1:gaCount
|
for I=1:gaCount
|
||||||
|
|
@ -42,5 +42,15 @@ for LOOP=1:100
|
||||||
ga(I).fitness=fitness;
|
ga(I).fitness=fitness;
|
||||||
end
|
end
|
||||||
end
|
end
|
||||||
|
%利用优化后的结果给出新的场景
|
||||||
|
newSnWind=zeros(randSNCount,96);
|
||||||
|
newSnSolar=zeros(randSNCount,96);
|
||||||
|
newSnP=zeros(randSNCount,96);
|
||||||
|
for I=1:randSNCount
|
||||||
|
onesIndex=sparse(bestIndex(I,:),1:96,1,16,96);
|
||||||
|
newSnWind(I,:)=sum(onesIndex.*snWind);
|
||||||
|
newSnSolar(I,:)=sum(onesIndex.*snSolar);
|
||||||
|
newSnP(I,:)=sum(onesIndex.*snP);
|
||||||
|
end
|
||||||
|
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue