The Combined Distribution and Assignment Model: A New Solution Algorithm and Its Applications in Travel Demand Forecasting for Modern Urban Transportation

Abstract

With the development of the advanced Intelligent Transportation System (ITS) in modern cities, it is of great significance to upgrade the forecasting methods for travel demand with the impact of ITS. The widespread use of ITS clearly changes the urban travelers’ behavior at present, in which case it is difficult for the conventional four-step travel demand forecasting model to have good performance. In this study, we apply the combined distribution and assignment (CDA) model to forecasting travel demand for modern urban transportation, in which travelers may choose the destination and path simultaneously. Furthermore, we present a new solution algorithm for solving the CDA model. With the network representation method that converts the CDA model into a standard traffic assignment problem (TAP), we develop a new path-based algorithm based on the gradient projection (GP) algorithm to solve the converted CDA model. The new solution algorithm is designed to find a more accurate solution compared with the widely used algorithm, the Evans’ two-stage algorithm. Two road networks, Sioux Falls and Chicago Sketch, are used to verify the performance of the new algorithm. Also, we conduct some experiments on the Sioux Falls network to illustrate several applications of the CDA model in consideration of the influences of ITS.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 13 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.