Improving Scalability of Generic Online Calibration for Real-Time Dynamic Traffic Assignment Systems

Flexible calibration of dynamic traffic assignment (DTA) systems in real time has important applications in effective traffic management. However, the existing approaches are either limited to small networks or to a specific class of parameters. In this light, this study presents a framework to systematically reduce the dimension of the generic online calibration problem, making it more scalable.

Specifically, a state–space formulation of the problem in the reduced dimension space is proposed. Following this the problem is solved using the constrained extended Kalman filter, which is made tractable because of the low dimensionality of the formulated problem. The effectiveness of the proposed approach is demonstrated using a real-world network leading to better state estimation by 13% and better state predictions by 11%—with a 50 fold dimensionality reduction.

Insights into choosing the right degree of dimensionality reduction are also discussed. This work has the potential for a more widespread application of real-time DTA systems in practice.