An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications

被引:88
作者
Zhou, Xuesong [1 ]
List, George F. [2 ]
机构
[1] Univ Utah, Dept Civil & Environm Engn, Salt Lake City, UT 84112 USA
[2] N Carolina State Univ, Dept Civil Construct & Environm Engn, Raleigh, NC 27695 USA
关键词
origin-destination demand estimation; sensor network design; traffic counts; automatic vehicle identification counts; AUTOMATIC VEHICLE IDENTIFICATION; MATRICES; OPTIMIZATION; ALGORITHMS; SELECTION;
D O I
10.1287/trsc.1100.0319
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
To design a transportation sensor network, the decision maker needs to determine what sensor investments should be made, as well as when, how, where, and with what technologies. This paper focuses on locating a limited set of traffic counting stations and automatic vehicle identification (AVI) readers in a network, so as to maximize the expected information gain for the subsequent origin-destination (OD) demand estimation problem. The proposed sensor design model explicitly takes into account several important error sources in traffic OD demand estimation, such as the uncertainty in historical demand information, sensor measurement errors, as well as approximation errors associated with link proportions. Based on a mean square measure, this paper derives analytical formulations to describe estimation variance propagation for a set of linear measurement equations. A scenario-based (SB) stochastic optimization procedure and a beam search algorithm are developed to find suboptimal point and point-to-point sensor locations subject to budget constraints. This paper also provides a number of illustrative examples to demonstrate the effectiveness of the proposed methodology.
引用
收藏
页码:254 / 273
页数:20
相关论文
共 40 条
[31]  
Van der Zijpp N.J., 1997, Transportation Research Record 1607, P87
[32]   THE MOST LIKELY TRIP MATRIX ESTIMATED FROM TRAFFIC COUNTS [J].
VANZUYLEN, HJ ;
WILLUMSEN, LG .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1980, 14 (03) :281-293
[33]  
*WIK, 2007, KALM FILT
[34]   Models and algorithms for the screen line-based traffic-counting location problems [J].
Yang, H ;
Yang, C ;
Gan, LP .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (03) :836-858
[35]   Heuristic algorithms for the bilevel origin destination matrix estimation problem [J].
Yang, H .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1995, 29 (04) :231-242
[36]   Optimal traffic counting locations for origin-destination matrix estimation [J].
Yang, H ;
Zhou, J .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1998, 32 (02) :109-126
[37]   AN ANALYSIS OF THE RELIABILITY OF AN ORIGIN-DESTINATION TRIP MATRIX ESTIMATED FROM TRAFFIC COUNTS [J].
YANG, H ;
IIDA, Y ;
SASAKI, T .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1991, 25 (05) :351-363
[38]   Evaluation of count location selection methods for estimation of O-D matrices [J].
Yim, PKN ;
Lam, WHK .
JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 1998, 124 (04) :376-383
[39]   Information-driven dynamic sensor collaboration [J].
Zhao, F ;
Shin, J ;
Reich, J .
IEEE SIGNAL PROCESSING MAGAZINE, 2002, 19 (02) :61-72
[40]  
Zhou X., 2005, IEEE Transactions on Intelligent Transportation Systems, V7, P105