高教社杯全国大学生数学建模竞赛B题参考答案

holdon end

a=jiedian2(32,2); b=jiedian2(32,3); plot(a,b,'k^') 程序：zuiduanju

functionD=zuiduanju()

a=jiedian; b=daolu; count=1;

n=length(a(:,1)); fori=1:length(b(:,1)) ifb(i,1)<=92&&b(i,2)<=92 c(count,:)=b(i,:); count=count+1; end end

fori=1:length(c(:,1))d(i)=sqrt((a(c(i,1),2)-a(c(i,2),2))^2+(a(c(i,1),3)-a(c(i,2),3))^2);%A区路口两节点的距离

end

c=sort(c,2); aa=zeros(n);

fori=1:length(c(:,1)) aa(c(i,1),c(i,2))=d(i); end

t=aa+aa';

M=max(max(t))*n^2;%M为充分大的正实数 t=t+((t==0)-eye(n))*M; %Floyd算法求最小矩阵 path=zeros(n); fork=1:n fori=1:n forj=1:n

ift(i,j)>t(i,k)+t(k,j) t(i,j)=t(i,k)+t(k,j); path(i,j)=k; end end end end

fori=1:length(t(:,1))

forj=1:length(t(:,1)) ift(i,j)>=M t(i,j)=0; end end end D=t;

程序：pingtai

functionA=pingtai()

D=zuiduanju(); A=zeros(20,72); f=jiedian(:,4); fork=21:92 fori=1:20

ifD(i,k)==min(D(1:20,k)) A(i,k-20)=D(i,k); end end end

fork=1:20 ifA(k,:)==0 fori=21:92

ifD(k,i)==min(D(k,21:92)) A(1:20,i-20)=0; A(k,i-20)=D(k,i); end end end end co=0;

q=zeros(2,20); fork=1:20

fprintf('到第%i平台时间最近的节点有：\\n',k); q(1,k)=k; q(2,k)=f(k)*; fori=1:72 ifA(k,i)~=0

fprintf('第%i个路口\\n',i+20); q(2,k)=q(2,k)+f(i+20)*A(k,i)/10; co=co+1; end end

end q

程序：zhipai D=zuiduanju(); e=churu(:,2); C=zeros(20,20); fork=1:92 fori=1:13 ifk==e(i)

C(1:20,i)=D(1:20,e(i)); end end end

C(1:20,14:20)=0; C

C=C(:);

a=zeros(40,400); fori=1:20

a(i,(i-1)*20+1:20*i)=1; a(20+i,i:20:400)=1; end

b=ones(40,1);

[x,y]=linprog(C,[],[],a,b,zeros(400,1),ones(400,1)); E=zeros(20,20); fori=1:20 forj=1:20

E(j,i)=x((i-1)*20+j); end end sum(E) fork=1:13 fori=1:20

ifE(i,k)==max(E(:,k))

fprintf('第%i路口',e(k));

fprintf('被第%i个平台控制,',i);

fprintf('距离为%i毫米\\n',D(i,e(k))); end end end

程序：zengjia

function[G,g,m]=zengjia() D=zuiduanju(); A=zeros(20,72);

fork=21:92 fori=1:20

ifD(i,k)==min(D(1:20,k)) A(i,k-20)=D(i,k); end end end no=0; fork=1:20 fori=1:72 ifA(k,i)>=30

%fprintf('到第%i平台时间最近的节点有：\\n',k); %fprintf('第%i个路口\\n',i+20); no=no+1; end end end

do=zeros(1,no); j=1;

fork=1:20 fori=1:72 ifA(k,i)>=30 do(1,j)=i+20; j=j+1; end end end

do=sort(do); F=D(do,do); j=21;

g=zeros(); fork=1:20 g(1,k)=k; end

fork=1:no

ifF(k,k+1:no)>=30 g(1,j)=do(1,k); j=j+1; end end

G=D(g,:); m=length(g); g