A BILEVEL PROGRAMMING MODEL FOR ESTIMATING ORIGIN-DESTINATION MATRICES FROM TRAFFIC COUNTS WITH CONGESTION EFFECTS

DOI Web Site 26 References

Bibliographic Information

Other Title
  • 交通混雑を考慮した観測リンク交通量からのOD交通量推計モデル

Abstract

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 the existing methods such as generalized least squares technique can be integrated with user equilibrium assignment in the form of a convex bilevel optimization problem. The existence of measurement errors and time variations in the observed link flows are explicitly taken into account. The feasibility of the model is always guaranteed without requirement of data preprocessing. A heuristic solution algorithm is presented and illustrated with a numerical example.

Journal

References(26)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top