交通分配之隨機配流算法matlab源碼（含最短路徑算法）

交通分配之隨機配流算法matlab源碼（含最短路徑算法）本文檔含兩個m文件dial.m和dijkstra1.m，dial需要調(diào)用dijkstra1。算例如下：算法如下：edge=[112234455678;...243565768989;...222221212222;];n=9;weight=inf*ones(n,n);Q=1000;start=1;endn=9;r=zeros(1,n);s=zeros(1,n);theta=1;L=zeros(n);OD=zeros(n);%====================================================================fori=1:nweight(i,i)=0;endfori=1:size(edge,2)weight(edge(1,i),edge(2,i))=edge(3,i);endLmin=zeros(1,n);fori=1:n[dis,path]=dijkstra1(weight,i,9);s(i)=dis;%任意節(jié)點到終點s的最小時間[dis,path]=dijkstra1(weight,1,i);r(i)=dis;%起點r到任意節(jié)點最小時間endfori=1:nforj=1:nifweight(i,j)>0&&weight(i,j)<inf&&r(i)<r(j)&&s(i)>s(j)L(i,j)=exp(theta*(r(j)-r(i)-weight(i,j)));%所有路段似然值endendendLMax=2000;temp=0;tempr=zeros(1,n);rr=zeros(1,n);rr=r;%出發(fā)節(jié)點i排序fori=1:nMin=2000;forj=1:nifrr(j)<min<p="">Min=rr(j);temp=j;endendrr(temp)=Max;tempr(i)=temp;LW=zeros(n);%前向計算路段權(quán)重fori=1:nforj=1:nifi==startLW(tempr(i),j)=L(tempr(i),j);elsesumlw=0;fortempi=1:9sumlw=sumlw+LW(tempi,tempr(i));endLW(tempr(i),j)=L(tempr(i),j)*sumlw;endendendtemprLWMax=2000;temp=0;temps=zeros(1,n);ss=s;%到達(dá)節(jié)點j排序fori=1:nMin=2000;forj=1:nifss(j)<min<p="">Min=ss(j);temp=j;endendss(temp)=Max;temps(i)=temp;endtemps%反向裝載流量forj=1:ntempOD=0;fortempi=1:9ifOD(temps(j),tempi)>0||OD(temps(j),tempi)==0tempOD=tempOD+OD(temps(j),tempi);endendfori=1:nsumlw=0;iftemps(j)==endnfortempi=1:9sumlw=sumlw+LW(tempi,temps(j));endOD(i,temps(j))=Q*LW(i,temps(j))/sumlw;elsefortempi=1:9sumlw=sumlw+LW(tempi,temps(j));endOD(i,temps(j))=LW(i,temps(j))*tempOD/sumlw;endendendODfunction[distance,path]=dijkstra1(A,s,e)%[DISTANCE,PATH]=DIJKSTRA(A,S,E)%returnsthedistanceandpathbetweenthestartnodeandtheendnode.%%A:adjcentmatrix%s:startnode%e:endnode%initializen=size(A,1);%nodenumberD=A(s,:);%distancevectorpath=[];%pathvectorvisit=ones(1,n);%nodevisibilityvisit(s)=0;%sourcenodeisunvisibleparent=zeros(1,n);%parentnode%theshortestdistancefori=1:n-1%BlueSethasn-1nodestemp=zeros(1,n);count=0;forj=1:nifvisit(j)temp=[temp(1:count)D(j)];elsetemp=[temp(1:count)inf];endcount=count+1;end[value,index]=min(temp);j=index;visit(j)=0;fork=1:nifD(k)>D(j)+A(j,k)D(k)=D(j)+A(j,k);parent(k)=j;endendenddistance=D(e);%theshortestdistancepathifparent(e)==0return;endpath=zeros(1,2*n);%pathpreallocationt=e;path(1)=t;count=1;whilet~=s&&t>0p=parent(t);path=[ppath(1:count)];t=p;count=count+1;endifcount>=2*nerror(['Thepat