Learn More
This paper deals with the problem of observability of traffic networks, understanding as such the problem of identifying which is the subset of the origin-destination (OD)-pair and link flows that can be calculated based on a subset of observed OD-pair and link flows, and related problems. A modified topological version of an existing algebraic method for(More)
A stochastic demand dynamic traffic model is presented to predict some traffic variables, such as link travel times, link flows, or link densities, and their time evolution in real networks. The model considers that the variables are generalized beta variables such that when they are marginally transformed to standard normal, they become multivariate(More)
This paper discusses the problem of optimizing the use of scanning resources for route flow estimation in traffic networks. Three problems are considered: (1) Minimize the number of cameras to be used for estimating a given subset of route flows; (2) identify the subsets of links to be scanned for a given number of available cameras, assuming that several(More)
This paper presents a first-in-first-out (FIFO) rule consistent model for the continuous dynamic network loading problem. The model calculates the link travel time functions at a basic finite set of equally spaced times that are used to interpolate a monotone spline for all the other times. The model assumes a nonlinear link travel time function of the link(More)
It is demonstrated that the minimum number of sensors required to know all link flows in a traffic network can be determined only if path information is available. However, not all paths need to be enumerated but, at most, a small subset defining the rank <i>rw</i> of the link-path incidence matrix W. If this rank for a reduced subset of paths is already(More)