Journey time estimator for assessment of road network performance under demand uncertainty

被引:19
作者
Shao, Hu [1 ,2 ]
Lam, William H. K. [1 ,3 ]
Sumalee, Agachai [1 ]
Chen, Anthony [4 ]
机构
[1] Hong Kong Polytech Univ, Dept Civil & Environm Engn, Kowloon, Hong Kong, Peoples R China
[2] China Univ Min & Technol, Dept Math, Xuzhou 221116, Jiangsu, Peoples R China
[3] Beijing Jiaotong Univ, Sch Traff & Transportat, Beijing 100044, Peoples R China
[4] Utah State Univ, Dept Civil & Environm Engn, Logan, UT 84322 USA
基金
中国国家自然科学基金;
关键词
Journey time estimator; Network performance; Demand uncertainty; Least Squares; Reliability; TRAFFIC COUNT INCONSISTENCIES; ORIGIN-DESTINATION MATRICES; TRAVEL-TIME; INFORMATION-SYSTEMS; MODEL; RELIABILITY;
D O I
10.1016/j.trc.2012.12.002
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
This paper proposes a journey time estimator (JTE) to estimate the stochastic journey time of each path for performance assessment in road network with uncertainty due to day-to-day demand variations. The stochastic network framework is adopted in this paper, in which link flows and path journey times are modeled as random variables so as to fully utilize the first- and the second-order statistical properties of the partial data collected for the journey time estimation. The second-order statistical property is referred to the variance-covariance (var-cov) of the observed path journey times and link flows available for the estimation. In this paper, the proposed JTE is formulated as a bi-level optimization problem. The objective of the upper-level problem is a variant of the Least Squares function, which considers the mean and var-cov of the observed path journey times. In addition, the observed statistical distribution of the link flow is also used to formulate a chance constraint in the upper-level problem. The lower-level problem is the reliability-based stochastic user equilibrium traffic assignment problem in stochastic network, which explicitly considers the reliability-based path choice behaviors of the road users under demand uncertainty. A heuristic iterative estimation-assignment algorithm is employed to solve the proposed hi-level problem. Numerical examples are provided to demonstrate the applications of the JTE and efficiency of the proposed algorithm. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:244 / 262
页数:19
相关论文
共 42 条
[1]  
Asakura Y., 1991, P 19 PTRC SUMMER ANN, P73
[2]  
Bell M.G.H., 1995, Proc. of the 4th International Conference on the Applications of Advanced Technologies in Transportation Engineering, ASCE, Carpi, P695
[3]  
Bouchier S., 2004, THESIS U DUBLIN
[4]   Capacity reliability of a road network: an assessment methodology and numerical results [J].
Chen, A ;
Yang, H ;
Lo, HK ;
Tang, WH .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2002, 36 (03) :225-252
[5]   A capacity related reliability for transportation networks [J].
Chen, A ;
Yang, H ;
Lo, HK ;
Tang, WH .
JOURNAL OF ADVANCED TRANSPORTATION, 1999, 33 (02) :183-200
[6]   Examining the quality of synthetic origin-destination trip table estimated by path flow estimator [J].
Chen, A ;
Chootinan, P ;
Recker, WW .
JOURNAL OF TRANSPORTATION ENGINEERING, 2005, 131 (07) :506-513
[7]   Mean-variance model for the build-operate-transfer scheme under demand uncertainty [J].
Chen, A ;
Subprasom, K ;
Ji, ZW .
TRANSPORTATION NETWORK MODELING 2003: PLANNNING AND ADMINISTRATION, 2003, (1857) :93-101
[8]   Strategies for selecting additional traffic counts for improving O-D trip table estimation [J].
Chen, Anthony ;
Pravinvongvuth, Surachet ;
Chootinan, Piya ;
Lee, Ming ;
Recker, Will .
TRANSPORTMETRICA, 2007, 3 (03) :191-211
[9]   L∞-Norm Path Flow Estimator for Handling Traffic Count Inconsistencies: Formulation and Solution Algorithm [J].
Chen, Anthony ;
Ryu, Seungkyu ;
Chootinan, Piya .
JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 2010, 136 (06) :565-575
[10]   Scenario-based multi-objective AVI reader location models under different travel demand patterns [J].
Chen, Anthony ;
Pravinvongvuth, Surachet ;
Chootinan, Piya .
TRANSPORTMETRICA, 2010, 6 (01) :53-78