《基于最短路搜索的多路径公交客流分配模型研究》由会员分享，可在线阅读，更多相关《基于最短路搜索的多路径公交客流分配模型研究（3页珍藏版）》请在金锄头文库上搜索。
1、第32卷第6期2002年11月 东南大学学报(自然科学版)JOURNAL OF SOUTHEAST UNIVERSITY(Natural Science Edition)Vol.32 No.6Nov.2002 KZs牛学勤王炜(2vY,2210096)K1:提出了一种首先采用最短路算法搜索有效路径集,再根据有效路径的广义费用,由改进的Logit模型确定每条有效路径的选择概率,进而计算每条线路客流量的公交客流分配模型.其中,任意两交通区之间的有效路径集是以换乘次数最少为准则,通过对不同选择情况下公交路网进行最短路搜索而获取.该模型既体现了乘客的费用最小的选择心理,又反映了出行线路多样性的实际情况
2、,而且算法简单、有效.初步实践证明,具有较强的实用性.1oM:公交客流分配;最短路搜索;多路径分配;有效路径集ms|:U121DSM:A cI|:1001-0505(2002)06-0917-03Study on the model of transit network multi-path assignmentbased on shortest path searchNiu XueqinWang Wei(Transportation College, Southeast University, Nanjing 210096, China)Abstract:A practical public
3、 transportation assignment model is put forward.The model uses the shortestpath algorithm to search the valid path set (between any two traffic district)that subject to the terms of min-imum bus change times, and then calculates every valid path s choosing probability according to their utili-ties,
4、finally calculates the passenger value of this path s.This model meets the passenger s path-selectingpsychology of minimum cost and reflects the fact of path-selecting multiplicity.The algorithm is simple andpractical.Key words:transit network assignment;shortest path search ;multi-path assignment;v
5、alid path setl:2002-04-16.:SE1S(59838310).Te:dW(1965),3,pV3;(),3,pV,q,pV3=,.g,YZT+,1Q14.EY14ZT 1 ,;BHqK(HL、_M%),HVZi4L_.L%、V4,PEZL4M.ZsL?1,1Bs1.V+EM,CVs,tiBJ,15?zEZ4,PT4i.4+V,9z4L(HWK,QK,nK),VKy.H,PKCs,4B,4+.In,9Zs/$,S+,4B?zQ4VKyy,7OEe、rZE.Ll,ZE#YVgHHW,HWHWB9;pN,NdBNH,p =0,lnH,|N,/km;CtHWN1.L=T,VCQw
6、.3.2H+H+V/F:Aj =(j,F(tj,sj ,p),lo)T,jHI|;F(tj ,sj,p)H,HWyYHW,HWV|?HWWB9;NdBNH,p|dBN,5p“0”.flo = 1$40$44Zs|XODsZT,V7LZ#_Z、.iYuW4,n5KE,YV4f/K,KQK,$r,r().BrriH($4),3.4)KE,Mi =i +1.6)i n,f1riH,i4),i n5.KEDijkstraE、FloydEMoore-papeE.,DijkstraEVvs 4 ,yN,V$.Z4BqV/T 49:pijk = exp(-Rk/ R)mh=1exp(-Rh/ R)(3)T,
7、pijkViujukH$4q;Rk ,RhsYViujuk ,hH0.YuWODBZsVijk =Vodijpijk (4)T,VijkkZs;Vodiji-jYuWOD9.5?y$,7yMd$.Q1,n5yBM,dZTYs.,N$+Mz?Y?#d,Y?f1,Mz?. 5v =v0 1 +0.53(Q/C)0.39 (5)T,v?;v01;QdZT?Y;C?MzY?.6LgEYy!-T,ZK1=,7EYZ4Zs.2000M12sg?,2vYF“gEYZ”5.ZsssIq.EZ-,;g8Y?ODgCL9,TZL_Z、z,Kv20%.yN,ZEBL.ID(References) 1.yYHq/LZnfZE J .,.Kg?E J .S,2000, 13(4):105 107.Liu Canqi, Yang Peikun.Urban main road network planninga
