Work

The Observability Problem in Traffic Network Models

Year: 2008

Type: article

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.

Source: Computer-Aided Civil and Infrastructure Engineering

DOI: 10.1111/j.1467-8667.2008.00531.x

Authors: Enrique Castillo, Antonio J. Conejo, José María Menéndez, Pilar Jiménez

Institutions: Universidad de Cantabria, University of Castilla-La Mancha

Language: English

Topic: Transportation Planning and Optimization

Subfield: Transportation

Field: Social Sciences

Domain: Social Sciences

SDGs: Industry, innovation and infrastructure, Sustainable cities and communities

Open Access status: hybrid

Estimated APC paid: $5,230