PREDICTING TRAFFIC FLOWIN ROAD NETWORKS - Using Bayesian Networks with Data from an Optimal Plate Scanning Device Location

S. Sánchez-Cambronero, A. Rivas, I. Gallego, J. M. Menéndez

Abstract

This paper deals with the problem of predicting route flows (and hence, Origin-Destination (OD) pair and link flows) and updating these predictions when plate scanned information becomes available. To this end, a normal Bayesian network is built which is able to deal with the joint distribution of route and link flows and the flows associated with all possible combinations of scanned link flows and associated random errors. The Bayesian network provides the joint density of route flows conditioned on the observations, which allow us not only the independent or joint predictions of route flows, but also probability intervals or regions to be obtained. A procedure is also given to select the subset of links to be observed in an optimal way. An example of application illustrate the proposed methodology and shows its practical applicability and performance.

References

  1. Bouckaert, R., Castillo, E., and Gutiérrez, J. M. (1996). A modified simulation scheme for inference in Bayesian networks. International Journal of Approximate Reasoning, 14(1):55-80.
  2. Cascetta, E. and Nguyen, S. (1988). A unified framework for estimating or updating origin/destination matrices from traffic counts. Transportation Research, 22B:437-455.
  3. Castillo, E., Gutiérrez, J. M., and Hadi, A. S. (1995). Parametric structure of probabilities in bayesian networks. In European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 95), pages 89-98. Symbolic and Quantitative Approaches to Reasoning and Uncertainty.
  4. Castillo, E., Gutiérrez, J. M., and Hadi, A. S. (1996). A new method for efficient symbolic propagation in discrete bayesian networks. Networks, 28(1):31-43.
  5. Castillo, E. and Kjaerulff, U. (2003). Sensivity analysis in Gaussian Bayesian networks using a symbolicnumerical technique. Reliability Engineering and System Safety, 79/2:139-148.
  6. Castillo, E., Menéndez, J. M., and Jiménez.P (2008a). Trip matrix and path flow reconstruction and estimation based on plate scanning and link observations. Transportation Research B, 42:455-481.
  7. Castillo, E., Menéndez, J. M., and Sánchez-Cambronero, S. (2008b). Predicting traffic flow using Bayesian networks. Transportation Research B, 42:482-509.
  8. Castillo, E., Menéndez, J. M., and Sánchez-Cambronero, S. (2008c). Traffic estimation and optimal counting location without path enumeration using Bayesian networks. Computer Aided Civil and Infraestructure Engineering, 23:189-207.
  9. Castillo, E., Sarabia, J. M., Solares, C., and Gómez, P. (1999). Uncertainty analyses in fault trees and Bayesian networks using form/sorm methods. Reliability Engineering and System Safety, 65:29-40.
  10. Conejo, A., Castillo, E., Mínguez, R., and García-Bertrand, R. (2006). Decomposition Techniques in Mathematical Programming. Engineering and Science Applications. Springer, Berlin.
  11. Doblas, J. and Benitez, F. G. (2005). An approach to estimating and updating origin-destination matrices based upon traffic counts preserving the prior structure of a survey matrix. Transportation Research, 39B:565- 591.
  12. Praskher, J. N. and Bekhor, S. (2004). Route choice models used in the stochastic user equilibrium problem: a review. Transportation Reviews, 24:437-463.
  13. Sun, S. L., Zhang, C. S., and Yu, G. Q. (2006). A Bayesian network approach to traffic flow forecasting. IEEE Transactions on Intelligent Transportation Systems, 7(1):124-132.
  14. Tebaldi, C. and West, M. (1996). Bayesian inference on network traffic using link count data. Journal of the American Statistical Association, 93:557-576.
  15. Van Zuylen, H. J. and Willumsen, L. (1980). Network tomography: The most likely trip matrix estimated from traffic-counts. Transportation Research B, 14:291- 293.
  16. Watling, D. (1994). Maximum likelihood estimation of an origindestination matrix from a partial registration plate survey. Transportation Research, 28B:289-314.
  17. Yang, H., Iidia, Y., and Sasaki, T. (1991). An analysis of the realiability of an origin-destination trip matrix estimated from traffic counts. Transportation Research, 25B:351-363.
  18. Yang, H. and Zhou, J. (1998). Optimal traffic counting locations for origin-destination matrix extimation. Transportation Research, 32B:109-126.
Download


Paper Citation


in Harvard Style

Sánchez-Cambronero S., Rivas A., Gallego I. and M. Menéndez J. (2010). PREDICTING TRAFFIC FLOWIN ROAD NETWORKS - Using Bayesian Networks with Data from an Optimal Plate Scanning Device Location . In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-674-021-4, pages 552-559. DOI: 10.5220/0002717705520559


in Bibtex Style

@conference{icaart10,
author={S. Sánchez-Cambronero and A. Rivas and I. Gallego and J. M. Menéndez},
title={PREDICTING TRAFFIC FLOWIN ROAD NETWORKS - Using Bayesian Networks with Data from an Optimal Plate Scanning Device Location},
booktitle={Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2010},
pages={552-559},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002717705520559},
isbn={978-989-674-021-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - PREDICTING TRAFFIC FLOWIN ROAD NETWORKS - Using Bayesian Networks with Data from an Optimal Plate Scanning Device Location
SN - 978-989-674-021-4
AU - Sánchez-Cambronero S.
AU - Rivas A.
AU - Gallego I.
AU - M. Menéndez J.
PY - 2010
SP - 552
EP - 559
DO - 10.5220/0002717705520559