ESTIMATION OF ORIGIN-DESTINATION MATRICES FROM LINK TRAFFIC COUNTS ON CONGESTED NETWORKS

被引：245

作者：

YANG, H ^{[1
]}

SASAKI, T ^{[1
]}

IIDA, Y ^{[1
]}

ASAKURA, Y ^{[1
]}

机构：

[1] EHIME UNIV,DEPT CIVIL ENGN,MATSUYAMA,EHIME 790,JAPAN

来源：

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL | 1992年 / 26卷 / 06期

关键词：

D O I：

10.1016/0191-2615(92)90008-K

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

Conventional methods for estimating origin-destination (O-D) trip matrices from link traffic counts assume that route choice proportions are given constants. In a network with realistic congestion levels, this assumption does not hold. This paper shows how existing methods such as the generalized least squares technique can be integrated with an equilibrium traffic assignment in the form of a convex bilevel optimization problem. The presence of measurement errors and time variations in the observed link flows are explicitly considered. The feasibility of the model is always guaranteed without a requirement for estimating consistent link flows from counts. A solution algorithm is provided and numerical simulation experiments are implemented in investigating the model's properties. Some related problems concerning O-D matrix estimation are also discussed.

引用

页码：417 / 434

页数：18

共 48 条

[1]

ASAKURA Y, 1990, 5 WORLD C TRANSP RES, P351

[2] CONVEX 2-LEVEL OPTIMIZATION [J].