The paper deals with the observability problem in traffic networks, including route, origin—destination and link flows, based on number plate scanning and link flow observations. A revision of the main observability concepts and methods is done using a small network. Starting with the full observability of the network based only on number plate scanning on some links, the number of scanned links is reduced and replaced by counted link flows, but keeping the full observability of all flows in the network. In this way, the cost can be substantially reduced. To this end, several methods are given and discussed, and two small and one real case of networks are used to illustrate the proposed methodologies. Finally, some conclusions and final recommendations are included. (Author/publisher)
Abstract