The Observability Problem in Traffic Models: Algebraic and Topological Methods

Data dependent input control for origin–destination demand estimation using observability analysis

“…We examine only the algebraic algorithm proposed inCastillo et al (2008a,b), as the topological algorithm provided inCastillo et al (2008b) is simply a fast approximation version.Y.Yang, Y. Fan / Transportation Research Part B 78 (2015) 385-403 …”

Sensor location problems in path-differentiated congestion pricing

“…Then the minimum sensor location problem can be stated as finding A # A with the minimum cardinality, such that S S a 2 A S a ¼ U. h Although this sensor location problem is NP-hard, some researchers, e.g., Castillo et al (2008b) and Ng (2012), proposed algorithms that can solve the problem for large networks in numerical experiments. In theory, these algorithms can take an exponential amount of CPU time to find an optimal solution.…”

“…Castillo et al (2008b), Castillo et al (2010), and Castillo et al (2011) discussed and proposed solution method for these types of problems.…”

Estimation of network origin-destination demands using heterogeneous vehicle sensor information: An optimal sensor deployment policy

“…In this section, The Nguyen-Dupuis network [11], [12], which consists of 13 nodes, 38 links, and 43 pairs and 8 O-D pairs (1-2, 1-3, 2-1, 2-4, 3-1, 3-4, 4-2, 4-3) is applied to evaluate the VDs and AVI sensors deployment configuration, and O-D demand estimation performance. This research assumes that and partial GPS information is available.…”

“…Some studies in the literature deal with the sensor location problem as a sub-problem within a broader network O-D estimation problem, and numerous sensor location deployment rules/principles have been proposed. For instance, the four sensor location rules: O-D covering rule, maximal flow fraction rule, maximal flow-interception rule, and link independent rule, are proposed by [38], graph theory for VD installation [5], schema theory for infrared beacon configuration [21], observibility problem for VD deployment [11], [12], [13], and a basis rule for inferring unequipped link flow information [22], [23].…”