wg.m

#include "stdio.h" #include "math.h" #include "malloc.h" #include "string.h" #define m 6 #defin

a=[0.075,0.225,0.075,0.075,1.125,12,0.5625];
b=[0.125,0.375,0.125,0.125,1.875,20,0.935];
c=(b-a)./4;
e=100;

%%%%%%%%%%%%%%%%%%%%%%%%粗网格计算最优费用 开始%%%%%%%%%%%%%%%%%%%%%%%%%
x=ones(7,3);%划分粗网格
for i=1:7
    x(i,:)=linspace(a(i),b(i),3);
end
xx=ones(3^7,7);%存放所有标定值组合,每一行为一组标定值
for i=1:3
    for j=1:3
        for k=1:3
            for l=1:3
                for m=1:3
                    for n=1:3
                        for o=1:3
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,1)=x(1,i);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,2)=x(2,j);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,3)=x(3,k);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,4)=x(4,l);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,5)=x(5,m);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,6)=x(6,n);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,7)=x(7,o);
                end;end;end;end;end;end;end;
A=0.01/3;
B=0.05/3;
C=0.1/3;
DJ=[A,B,C]; % 三个容差的方差        
D=ones(108,7);%存放108种容差组合
D(:,1)=B*ones(108,1);% 指标x1只有一个容差等级
D(:,5)=C*ones(108,1); % 指标x5只有一个容差等级 
for i=2:3
    for j=1:3
        for k=1:3
            for l=1:3
                for m=1:2
                    D((i-2)*2*3^3+(j-1)*3*3*2+(k-1)*3*2+(l-1)*2+m,2)=DJ(i);
                    D((i-2)*2*3^3+(j-1)*3*3*2+(k-1)*3*2+(l-1)*2+m,3)=DJ(j);
                    D((i-2)*2*3^3+(j-1)*3*3*2+(k-1)*3*2+(l-1)*2+m,4)=DJ(k);
                    D((i-2)*2*3^3+(j-1)*3*3*2+(k-1)*3*2+(l-1)*2+m,6)=DJ(l);
                    D((i-2)*2*3^3+(j-1)*3*3*2+(k-1)*3*2+(l-1)*2+m,7)=DJ(m);
                end;end;end;end;end;
minzz=3000000;%最小费用的初始值
for i=1:108
    minz=3000000;%保存当前最小费用
    for j=1:(3^7)
        z=Czfee(xx(j,:),D(i,:)); % 每一种指标组合对应108种容差组合故共有108*3^7种组合
        if minz>z
            minz=z;
            minx=xx(j,:);%保存当前最优标定值组合
            minD=D(i,:);%保存当前最优容差组合
        end
    end
    if minzz>minz%保存内循环依次得到的最优解
        minzz=minz;
        minxx=minx;
        minDD=minD;
    end
%     minzz
%     i
end
%%%%%%%%%%%%%%%%%%%%%%粗网格计算最优费用 结束%%%%%%%%%%%%%%%%%%%%%%%%%


minzzz=minzz;%粗网格最优解
%%%%%%%%%%%%%%%%%%%%%%细网格求全局最优费用  开始%%%%%%%%%%5%%%%%%%%%%%%
for s=1:2
c1=c./(4^(s-1));%c1为细网格的搜索半径
a1=minxx-c1;%minxx中保存粗网格最优标定值组合
b1=minxx+c1;%[a1,b1]为细网格的搜索空间
for i=1:7
    if a1(i)<a(i)
        a1(i)=a(i);
    end
    if b1(i)>b(i)
        b1(i)=b(i);
    end
end
% a1
% b1
for i=1:7
    x(i,:)=linspace(a1(i),b1(i),3);
end
for i=1:3
    for j=1:3
        for k=1:3
            for l=1:3
                for m=1:3
                    for n=1:3
                        for o=1:3
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,1)=x(1,i);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,2)=x(2,j);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,3)=x(3,k);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,4)=x(4,l);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,5)=x(5,m);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,6)=x(6,n);
                    xx((i-1)*3^6+(j-1)*3^5+(k-1)*3^4+(l-1)*3^3+(m-1)*3^2+(n-1)*3+o,7)=x(7,o);
                end;end;end;end;end;end;end;
minzz1=minzz;
for i=1:108
    minz=minzz1;
    for j=1:(3^7)
        z=Czfee(xx(j,:),D(i,:));
        if minz>z
            minz=z;
            minx=xx(j,:);
            minD=D(i,:);
        end
    end
    if minzz>minz
        minzz=minz;
        minxx=minx;
        minDD=minD;
    end
    %i
end
minzzz1=minzzz
if minzzz>minzz
    minzzz=minzz;
    minxxx=minxx;
    minDDD=minDD;
end
if abs(minzzz1-minzzz)<e
    break;
end
minzzz %the best solution
minxxx %最优标定值组合
minDDD %最优容差组合
end % row 69 for