科研之友
微信
新浪微博
Facebook
分享链接
摘要
The focus of this paper is on the development of an origin-destination (O-D) demand estimation method for dynamic equilibrium traffic networks. It is hypothesized that the underlying equilibrium conditions in such networks are a compromise result of minimization of individual routing costs, minimization of traffic count matching errors, and maximization of O-D demand entropies. By adding an upper bound of travel demand and a dummy path with constant travel cost to each O-D pair, we formulated the dynamic O-D demand estimation problem as an excess-demand dynamic traffic assignment (DTA) problem defined for an expanded network with dummy paths. Such a formulation enables us to apply existing DTA solution methods and software tools for deriving the path flow pattern in the expanded network and thus simultaneously obtaining the O-D demand pattern in the original network. Following this problem transformation and network expansion strategy, an iterative solution procedure is accordingly proposed, which resorts to repeatedly solving the excess-demand DTA problem and adjusting the dummy path costs. An application of the proposed modeling and solution methods for an example cell-based network problem favorably illustrates great promise of the methodological advance and solution performance.
- 出版日期2015-12
- 单位上海交通大学
