Incorporating Trip Chaining within Online Demand Estimation
Guido Cantelmo, Moeid Qurashi, A. Arun Prakash, Constantinos Antoniou,, Francesco Viti

TL;DR
This paper presents a novel online demand estimation framework that explicitly incorporates trip-chaining behavior using Kalman Filtering, improving prediction accuracy for dynamic traffic management.
Contribution
It introduces a state-space model that explicitly includes trip-chaining, enabling joint calibration of trips within tours and better day-long demand predictions.
Findings
Improved demand prediction accuracy over traditional methods
Effective on both toy and real-world networks
Ability to predict evening demand from morning data
Abstract
Time-dependent Origin-Destination (OD) demand flows are fundamental inputs for Dynamic Traffic Assignment (DTA) systems and real-time traffic management. This work introduces a novel state-space framework to estimate these demand flows in an online context. Specifically, we propose to explicitly include trip-chaining behavior within the state-space formulation, which is solved using the well-established Kalman Filtering technique. While existing works already consider structural information and recursive behavior within the online demand estimation problem, this information has been always considered at the OD level. In this study, we introduce this structural information by explicitly representing trip-chaining within the estimation framework. The advantage is twofold. First, all trips belonging to the same tour can be jointly calibrated. Second, given the estimation during a certain…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
