.png){kind=icon}
.png){kind=icon}
Return
Traffic estimation and optimal counting location without path enumeration using Bayesian networks
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1467-8667.2008.00526.x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
ORIGIN-DESTINATION MATRICES
EQUILIBRIUM ASSIGNMENT
ALGORITHM
MODELS
FLOWS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
9.1
Papers:
2.0K
Citations:
10.0K