Observability in traffic networks. Plate scanning added by counting information
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. Copyright Springer Science+Business Media, LLC. 2012
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 39 (2012)
Issue (Month): 6 (November)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/regional+science/journal/11116/PS2|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Hu, Shou-Ren & Peeta, Srinivas & Chu, Chun-Hsiao, 2009. "Identification of vehicle sensor locations for link-based network traffic applications," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 873-894, September.
- Maher, Michael J. & Zhang, Xiaoyan & Vliet, Dirck Van, 2001. "A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 23-40, January.
When requesting a correction, please mention this item's handle: RePEc:kap:transp:v:39:y:2012:i:6:p:1301-1333. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.