Զѧ
ACTA AUTOMATICA SINICA
2000Vol.26No.3P.303-309



ڹODĽͨ
ŷֲ
ܾʢ嫡ν
ժҪڹзֲ(OD)Ľͨĺֲ.ݼӦĹ򣬽˹ڼֲķԹ滮ģ.֪תƸʵǰ£ķֲһƽMarkov߹, ͨתΪһȼ۵Թ滮.ʵģЧġ.
ؼʡзֲ󣬽ͨ㣬ƽɷ߹̣Թ滮.
OPTIMAL LOCATION OF TRAFFIC COUNTING POINTS
FOR ESTIMATING OD TRIP MATRIX
ZHOU JingSHENG ZhaohanHE Jianmin
(School of Economics and Management,Southeast University,Nanjing210096)
YANG Hai
(Dept.of Civil & Structural Engineering,the Hong Kong University of Science & Technology,Hong Kong)
WANG Changjun
(Traffic Management Research Institute,Wuxi214151)
AbstractThis paper discusses how to determine the optimal number and locations of traffic counting points in a road network for estimating the origin-destination trip matrix. Based on location rules, a nonlinear programming model for determining the optimal locations of traffic counting points is addressed under a given OD distribution pattern. Such problem can also be described as an average reward Markov decision process (MDP) with additional constraints, which can be equivalent to an integer linear programming problem. The computational example shows that the results obtained are satisfactory. 
Key wordsOrigin-destination trip matrix, traffic counting points, average reward Markov decision process, integer linear programming.
1
зֲ(Origin-destination),OD,һǳҪĽͨ.ѧͨ·μODֲо12.ģ3ݹѡӦѭĸ.Щ֪OD·£ȷֲ0-1滮ģ.ĽչöOD·һ.ֲⱻΪһƽɷ߹.󣬸ģ4еĻͨһȼ۵滮üŷֲ.
2ֲѧ滮ģ
2.1ֲ
ǽͨG(N,A).ʵԽ㼯NΪࣺNOʾ㼯ϣNDʾյ㼯ϣNTʾм㼯.Щǻ͵ĵ㣬յ.Ϊڷͨһ㽫ֿ.ǣNOND=N=NONDNT.֪һODзֲT=(tij),E(eij)ʾתƸʾeijʾijתƸʣ(i,j)A,eij=0.ʵϣתƸOD·ϵķصģǿԽ㷨5ݶӻתƸʾ.⣬ԸODTÿһĳռܵODıֵ.зʼi, i=0ɵõÿһĳʼзֲ=(1,2,,£N)֮ΪʼֲNʾNеԪظ.
2.2ֲѧ滮ģ
ǵڹODзֲĽֲͨ·ϣǼϣÿһ·ζΪһļ.·(i,j)һ⼫k, ֲֻܷЩ.ʱתƸʾҲ仯eik=eij,ekj=1,eij=0.NAʾЩɵļ,ӦG(N,A)ҲΪN=NONDNTNA.Ϊzʾķֲ.zзȡ01i⣬Ӧzi=1,iΪ㣻zi=0iΪǲ.ʵϣiNA,zi=0.üʱӦעظ.ΪˣͨıתƸʵ.
(1)
һļֲzij(z)ʾӼiＫjĸʣµƹϵ
(2)
ikODԼ·j(Ϊ)ıΪikij(z),ȹ򣬼ֲzѡӦʹikij(z)ܴ.ʾODǹķֲɵļϣʾļĿ·滮ģ
(3)
(4)
(5)
ȻĿ꺯(3)ָ·ϱ⵽ֵԼ(4)֤ODǹ3.ڶÿһ㼴ʱ(1)ʽıתƸʣظӶҲ֤Թ3.ΪĿ꺯(3)еĦij(z)һֱ(TCL-P)ǳ.潫(TCL-P)ΪһԼƽɷ߹.
3ɷ
3.1ֲɷ
֪תƾEͳʼзֲ¿Խ·ϵпһɷ.ÿһǷü㼴Ϊһߣÿһ⵽ʿꡱ.µɷ߹̣״̬NÿһiN,߼A(i)ԪأA(i)=2A(i)=1.ǰ߱ʾiΪ㣬߱ʾiΪǲ.ɴˣڼֲzһȷԲd֮佨һһӦĹϵ
(6)
,ͨɷdӻѼֲz.ȻֻеiNAſA(i)=2.piajʾһƽɷ״̬iѡaһʱ̵״̬jתƸʣʽ
(7)
ɼpiajֲתƸijһµ.״̬iѡaıΪria=0,a=1;ria=1,a=2.൱ڸϾ߹̵ĳʼֲÿĳʼг.һ棬ע⵽ֲODǹ򣬼z.ǣһɷȷԲdȷķֲzһһ.ΪˣȽһȷODǹСĿģ(TCL-P0)
(8)
(9)
za=0.1,aA.(10)
wODԼĳ·aaw=1aw=0.(TCL-P0)һODǹļֲz0Ͳl0.
NAD=iNAz0i=1,NAT=iNAz0i=0,(11)
z0iz0ĵi.ΪԤĲ=-l0Ϊʣ.潫ȷ.NATΪĺѡ㼯,iNAT,zj=0.(TCL-P)תΪʽ
 (12a)
(12b)
zj=(0,1),jNAT.(12c)
D()={d|dɷԣǡڸͬ״̬ѡa=2}.֤(RTCL-P)µɷǵȼ۵(μף4,6)
(13)
бʾɲdһɷ߹(MDP)ƽ.ֱһɷ(13)ҲǷǳѵģҸ˷ͨһȼ۵Թ滮.
3.2ȼ۵Թ滮
һϲԦκʱT,
(14)
ʾ״̬jľΪaʱʱTڣϵͳ״̬jƽƵ.xja()=ڣxja()ԽΪڲԦε£״̬jľΪaʱڼʱ(Զʱ), ϵͳĳе״̬jֵ.֤(μף4,6).
1. κƽȲԦ,
(15)
2.zһֲdzʽ(8)Ĳԣ
(16)
ʽ(16)˵xi2(d(z))˳гڲi۲⵽ֵ.
Kallenberg4ݽһƽȵϾ߹һԹ滮֮Ĺϵ.ݴ˿µĶ:
1.滮
(17a)
(17b)
(17c)
xi2zi,iN,(17d)
(17e)
xia,yia0,zi=(0,1),iN,aA(i).(17f)
1)(x*,y*,z*)(MIP-1)Ž,z*(RTCL-P)Ž,d(z*)MDP(D())Ų;
2)z*(RTCL-P)Ž,d*=d(z*),x*=x(d*),y*ʹ(x*,y*,z*)Ϊ(MIP-1)Ž.
ɴ˶֪(x*,y*,z*)(MIP-1)Ž⣬d*=d(z*)ΪӦŲԣӶx*=x(d*).(MIP-1)ɻΪ
