Efficient implementation of method of successive averages in simulation-based dynamic traffic assignment models for large-scale network applications

Hayssam Sbayti, Chung-Cheng Lu, Hani S. Mahmassani

研究成果: Chapter同行評審

45 引文 斯高帕斯(Scopus)

摘要

The method of successive averages remains by far the most widely used solution heuristic in simulation-based dynamic traffic assignment. Its simplicity and the nonrequirement of derivative information for the flow-cost mapping function are the main reasons for its widespread use, especially in the realm of dynamic traffic assignment (DTA). However, its convergence properties in real-life networks have been inconclusive, especially because (a) simulation-based models typically are not well behaved mathematically, and therefore their solution properties are not guaranteed, and (b) predetermined step sizes do not exploit local information in searching for a solution and therefore tend to have sluggish performance properties. An effort was made to improve on the performance of the method of successive averages heuristic for user-equilibrium and system-optimal DTA problems on large congested networks through novel implementations that derive their efficiency from exploiting local information made available in the results of vehicle-based simulation models used to provide the mapping between a feasible path flow assignment and the experienced travel cost in a DTA solution framework. The results of extensive numerical tests on actual networks are reported, confirming the performance improvements attainable with the new approach.

原文English
主出版物標題Network Equilibrium Modeling 2007
頁面22-30
頁數9
版本2029
DOIs
出版狀態Published - 1 十二月 2007

出版系列

名字Transportation Research Record
號碼2029
ISSN(列印)0361-1981

指紋

深入研究「Efficient implementation of method of successive averages in simulation-based dynamic traffic assignment models for large-scale network applications」主題。共同形成了獨特的指紋。

引用此