Premium
Traffic Estimation and Optimal Counting Location Without Path Enumeration Using Bayesian Networks
Author(s) -
Castillo Enrique,
Menéndez José María,
SánchezCambronero Santos
Publication year - 2008
Publication title -
computer‐aided civil and infrastructure engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.773
H-Index - 82
eISSN - 1467-8667
pISSN - 1093-9687
DOI - 10.1111/j.1467-8667.2008.00526.x
Subject(s) - path (computing) , enumeration , bayesian probability , variance (accounting) , matrix (chemical analysis) , computer science , link (geometry) , bayesian network , mathematics , mathematical optimization , statistics , algorithm , combinatorics , materials science , accounting , business , composite material , programming language
This article deals with the problem of estimating and updating the origin‐destination matrix and link flows from traffic counts and its optimal location. A combination (bi‐level) of an OD‐pair matrix estimation model based on Bayesian networks, and a Wardrop‐minimum‐variance model, which identifies origins and destinations of link flows, is used to estimate OD‐pair and unobserved link flows based on some observations of links and/or OD‐pair flows. The Bayesian network model is also used to select the optimal number and locations of the links counters based on maximum correlation. Finally, the proposed methods are illustrated by their application to the Nguyen–Dupuis and the Ciudad Real networks.