交通分配之随机配流算法matlab源码(含最短路径算法)

本文档含两个m文件dial.m和 dijkstra1.m ，dial需要调用dijkstra1。算例如下：算法如下：Dial.medge = 1 1 2 2 3 4 4 5 5 6 7 8 ;. 2 4 3 5 6 5 7 6 8 9 8 9 ;. 2 2 2 2 2 1 2 1 2 2 2 2 ; ; 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);%=for i=1:n weight(i, i)=0;endfor i=1:size(edge,2)weight(edge(1, i), edge(2, i)=edge(3, i);endLmin = zeros(1,n);for i=1: n dis, path=dijkstra1(weight, i, 9) ;s(i) = dis; % 任意节点到终点s的最小时间 dis, path=dijkstra1(weight, 1, i) ; r(i) =dis; % 起点r到任意节点最小时间 endfor i = 1 : n for j = 1:n if weight(i,j) 0 & weight(i,j) inf & r(i) s(j) L(i,j) = exp( theta *(r(j) -r(i) -weight(i,j) ) ; %所有路段似然值 end end end LMax =2000;temp =0 ;tempr =zeros(1,n);rr= zeros(1,n);rr = r ;% 出发节点i排序for i =1 :n Min = 2000; for j= 1 :n if rr(j) Min Min = rr(j); temp = j ; end end rr(temp)= Max; tempr(i) =temp;endLW = zeros(n);% 前向计算路段权重for i = 1 : n for j = 1 :n if i = start LW (tempr(i),j)= L(tempr(i),j) ; else sumlw = 0; for tempi =1 :9 sumlw = sumlw +LW(tempi,tempr(i) ); end LW (tempr(i),j)= L(tempr(i),j)*sumlw; end endendtemprLWMax =2000;temp =0;temps =zeros(1,n);ss = s ;% 到达节点j排序for i =1 :n Min = 2000; for j= 1 :n if ss(j) 0 | OD(temps(j),tempi ) =0 tempOD = tempOD+OD(temps(j),tempi ); end end for i = 1 :n sumlw = 0; if temps(j)= endn for tempi =1 :9 sumlw = sumlw +LW(tempi,temps(j) ); end OD(i,temps(j)= Q* LW(i,temps(j)/sumlw ; else for tempi =1 :9 sumlw = sumlw +LW(tempi,temps(j) ); end OD(i,temps(j) = LW(i,temps(j)*tempOD/ sumlw ; end end endODfunction distance,path=dijkstra1(A,s,e)% DISTANCE,PATH=DIJKSTRA(A,S,E)% returns the distance and path between the start node and the end node.% A: adjcent matrix% s: start node% e: end node% initializen=size(A,1); % node numberD=A(s,:); % distance vectorpath=; % path vectorvisit=ones(1,n); % node visibilityvisit(s)=0; % source node is unvisibleparent=zeros(1,n); % parent node% the shortest distancefor i=1:n-1 % BlueSet has n-1 nodes temp=zeros(1,n); count=0; for j=1:n if visit(j) temp=temp(1:count) D(j); else temp=temp(1:count) inf; end count=count+1; end value,index=min(temp); j=index; visit(j)=0; for k=1:n if D(k)D(j)+A(j,k) D(k)=D(j)+A(j,k); parent(k)=j; end endenddistance=D(e);% the shortest distance pathif parent(e)=0 return;endpath=zeros(1,2*n); % path preallocationt=e; path(1)=t; count=1;while t=s & t0 p=parent(t); path=p path(1:count); t=p; count=count+1;endif count=2*n error