Name
Abstract | ||
|---|---|---|
This article deals with the problem of observability of traffic networks, understanding as such the problem of identifying which is the subset of OD-pair and link flows that can be calculated based on a subset of observed OD-pair and link flows and related problems. Two algebraic methods for solving the observability problems are given, one global approach based on null-spaces and a step by step procedure allowing updating the information once each item of information (OD-pair or link flow) becomes available. In particular, seven different observability problems are stated and solved using the proposed methods, which are illustrated by their application to the Nguyen-Dupuis network problem. The results show that the proposed methods provide useful information on which OD-pair or link flows are informative on other OD-pair and link flows, and that the methods are applicable to large networks. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1111/j.1467-8667.2008.00531.x | COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING |
Keywords | Field | DocType |
network model,observability,traffic flow,traffic engineering | Mathematical optimization,Observability,Large networks,Algebraic number,Traffic flow,Algebraic method,Traffic network,Engineering,Traffic engineering | Journal |
Volume | Issue | ISSN |
23 | 3 | 1093-9687 |
Citations | PageRank | References |
26 | 2.05 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Enrique Castillo | 1 | 555 | 59.86 |
| Antonio Conejo | 2 | 189 | 24.33 |
| José María Menéndez | 3 | 109 | 8.16 |
| Pilar Jiménez | 4 | 40 | 3.93 |