Abstract
AbstractThis 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.
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have