Predicting traffic flow using Bayesian networks

This paper deals with the problem of predicting traffic flows and updating these predictions when information about OD pairs and/or link flows becomes available. To this end, a Bayesian network is built which is able to take into account the random character of the level of total mean flow and the v...

Full description

Saved in:
Bibliographic Details
Published inTransportation research. Part B: methodological Vol. 42; no. 5; pp. 482 - 509
Main Authors Castillo, Enrique, Menéndez, José María, Sánchez-Cambronero, Santos
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier Ltd 01.06.2008
Elsevier
SeriesTransportation Research Part B: Methodological
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This paper deals with the problem of predicting traffic flows and updating these predictions when information about OD pairs and/or link flows becomes available. To this end, a Bayesian network is built which is able to take into account the random character of the level of total mean flow and the variability of OD pair flows, together with the random violation of the balance equations for OD pairs and link flows due to extra incoming or exiting traffic at links or to measurement errors. Bayesian networks provide the joint density of all unobserved variables and in particular the corresponding conditional and marginal densities, which allow not only joint predictions, but also probability intervals. The influence of congested traffic can also be taken into consideration by combination of the traffic assignment rules (as SUE, for example) with the Bayesian network model proposed. Some examples illustrate the model and show its practical applicability.
ISSN:0191-2615
1879-2367
DOI:10.1016/j.trb.2007.10.003