By Topic

Optimal Use of Plate-Scanning Resources for Route Flow Estimation in Traffic Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Castillo, E. ; Dept. of Appl. Math. & Comput. Sci., Univ. of Cantabria, Santander, Spain ; Gallego, I. ; Menendez, J.M. ; Rivas, A.

This paper discusses the problem of optimizing the use of scanning resources for route flow estimation in traffic networks. Three problems are considered: (1) Minimize the number of cameras to be used for estimating a given subset of route flows; (2) identify the subsets of links to be scanned for a given number of available cameras, assuming that several runs can be done; and (3) solve the previous problems with consideration of scanning errors and error recovery. In addition to the main objective, which consists of minimizing the number of cameras, minimizing the total number of links to be scanned in all runs and maximizing the number of determined route flows are also considered as secondary and tertiary objectives, respectively. A simple and a medium-size real network are used to illustrate the proposed methods and prove the feasibility of the proposed methodology.

Published in:

Intelligent Transportation Systems, IEEE Transactions on  (Volume:11 ,  Issue: 2 )