数学建模第五次优秀论文设计研读资料报告材料.docVIP

Matlab创新奖 第一问 （1）A区交巡警平台管辖围Matlab程序 方法一： clc clear A=load(全区线路节点连接.txt); B=load(全区数据.txt); C=load(巡警平台.txt); qidian=A(:,1);zhongdian=A(:,2); jiedian=B(:,1);jiedianx=B(:,2);jiediany=B(:,3); z=inf*ones(length(jiedian),length(jiedian)); for i=1:length(jiedian) z(i,i)=0; end for i=1:length(qidian) z(qidian(i),zhongdian(i))=sqrt((jiedianx(qidian(i))-jiedianx(zhongdian(i))).^2+(jiediany(qidian(i))-jiediany(zhongdian(i))).^2); z(zhongdian(i),qidian(i))=z(qidian(i),zhongdian(i)); end [D,path]=floyd(z); guanxia=[]; for i=1:length(jiedian) t=inf; for j=1:length(C) if tD(i,C(j)) t=D(i,C(j)); m=C(j); end end guanxia=[guanxia;m,i]; end Aguanxia=[]; for j=1:20 for i=1:length(jiedian) if guanxia(i,1)==j Aguanxia=[Aguanxia;guanxia(i,:)]; end end end Aguanxia 方法二： clear A=xlsread(A10.xls,全市交通路口节点数据,A2:E93); B=xlsread(A10.xls,全市交通路口的路线,A2:B144); d=ones(92,92)*inf; x=A(:,2); y=A(:,3); for i=1:92 for k=1:143 if B(k,1)==iB(k,2)93 j=B(k,2); d(i,j)=sqrt((x(i)-x(j)).^2+(y(i)-y(j)).^2); end end end for i=1:92 for j=1:92 if i==j d(i,j)=0; end if d(i,j)inf d(j,i)=d(i,j); end end end for i=1:20 for j=21:92 [D,path,min1,path1]=floydf(d,i,j); end End clear A=xlsread(A10.xls,距离); A=A(1:20,:); a=[]; for i=21:92 [x y]=find(A(:,i)==min(A(:,i))); a=[a x]; end b=(a) 第j个平台到第K个出口的距离： clear A=xlsread(A10.xls,距离); B=[12 14 16 21 22 23 24 28 29 30 38 48 62 ]; A=A(1:20,:); a=ones(20,13); for j=1:20 for k=1:13 for i=1:92 if i==B(k) a(j,k)=A(j,i);break end end end end （2）调度20个平台封锁13个出口，要求能在最短的时间实现完全封锁，这就要求封锁最后一个出口的时间要最短。最后一个封锁的出口就是每个平台调度的最远的距离。要求最远的距离最短。 model: sets: yaodao/1..13/; pingtai/1..20/; fangan(yaodao,pingtai):x,d; endsets data: d=file(w.txt); text()=table(x); enddata min=u; for(fangan:u=x*d); for(yaodao(i):sum(pingtai(j):x(i,j))=1); for(pingtai(j):sum(yao