Observability of traffic networks. Optimal location of counting and scanning devices

Castillo, Enrique; Nogal, María; Rivas, Ana; Sánchez-Cambronero, Santos

doi:10.1080/21680566.2013.780987

Cited by 29 publications

(32 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This problem has been receiving attention because with the economic development, the demand for travel on roads is growing at a rate faster than the urban transportation system can accommodate and the budget and land for expanding the system are limited. Sometimes, this problem has been generalized to consider toll setting (e.g., Shepherd, ; Li et al, ), signal control (e.g., Hawas, ), optimal counting locations (Castillo et al, ), ramp metering, and other transportation NDPs (Zanjirani Farahani et al, ).…”

Section: Introductionmentioning

confidence: 99%

The Chemical Reaction Optimization Approach to Solving the Environmentally Sustainable Network Design Problem

Szeto

Wang

Wong

2013

Computer aided Civil Eng

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

The Chemical Reaction Optimization Approach to Solving the Environmentally Sustainable Network Design Problem

Szeto

Wang

Wong

2013

Computer aided Civil Eng

View full text Add to dashboard Cite

“…This model calibration approach was motivated by similar works done in the area of traffic flow estimations, in which one observes traffic in some links and tries to estimate OD flows or flows on remaining links (e.g. Bell, 1991;Castillo et al, 2007;Castillo et al, 2008a;Castillo et al, 2010;Castillo et al, 2011;Castillo et al, 2013;Maher, 1983;Ng, 2012;He, 2013;Watling and Maher, 1992;Watling, 1994;Yang et al, 1992;Yang, 1995;Shen and Wynter, 2012). The ABM calibration proposed in this paper is formulated as a maximum likelihood estimation problem for reproducing the collected link counts and sensor path flow information.…”

Section: Introductionmentioning

confidence: 99%

Statistical approach for activity-based model calibration based on plate scanning and traffic counts data

Siripirote

Sumalee

et al. 2015

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

“…Sensor location affects the accuracy of link flow determination. The link flow determination problem is defined as determining the minimum quantity and optimal location of observed links from the flows on which all of the flows on unobserved links can be uniquely determined (Castillo, Nogal, Rivas, & Sánchez‐Cambronero, ). Flow information on an individual link can be directly collected by installing sensors on the link, such as loop detectors and automatic vehicle identifications (AVIs).…”

Section: Introductionmentioning

confidence: 99%

Road side unit location optimization for optimum link flow determination

Liang

2019

Computer aided Civil Eng

View full text Add to dashboard Cite

This study addresses the problem of road side unit (RSU) location optimization for optimum link flow determination. The error of link flow determination using RSU information comes from two sources: measurement error and inference error. The inference error is caused by the propagation and accumulation of measurement error during the link flow inference process. The direct problem formulation aiming to minimize the total error is impossible because the minimization of inference error has to be indirectly formulated as the minimization of the cumulative number of unobserved links. Further, for a given number of RSU, the decrease in the cumulative number of unobserved links results in the increase of the number of observed links, and thus results in the increase of measurement error due to data packet queueing delay. Therefore, for a given RSU installation budget, the balance between the two types of error needs to be optimized in order to achieve the optimum link flow determination accuracy. To fulfill this goal, the RSU location optimization problem is formulated as a bi‐objective nonlinear binary integer programming. This programming is constrained by complete link flow determination requirements. In order to accelerate computation, an efficient ε‐constraint method is designed to generate Pareto optimal frontier. The subproblem solved at each iteration is linearized using piecewise linear approximation and solved using a constraint generation method. The proposed model and the solution algorithm are evaluated through numerical examples. The results reveal that the Pareto optimal solutions achieved by the proposed model are at least not inferior to a non‐Pareto solution obtained in the baseline scenario. Further, both the measurement error and inference error associated with some of the Pareto optimal points are lower than those associated with the non‐Pareto optimal solution.

show abstract

Observability of traffic networks. Optimal location of counting and scanning devices

Cited by 29 publications

References 33 publications

The Chemical Reaction Optimization Approach to Solving the Environmentally Sustainable Network Design Problem

The Chemical Reaction Optimization Approach to Solving the Environmentally Sustainable Network Design Problem

Statistical approach for activity-based model calibration based on plate scanning and traffic counts data

Road side unit location optimization for optimum link flow determination

Contact Info

Product

Resources

About