Wednesday, 15:15 - 15:40 h, Room: MA 141


Zhili Zhou
A network based model for traffic sensor placement with implications on congestion observation


In this paper, we define and solve the traffic sensor placement problem for congestion observation, which targets to place
the minimum number and location of traffic sensors in order to infer all traffic flow information in a dynamic changing congestion area. To handle uncertain traffic flow, we formulate this problem as a stochastic mixed-integer programming
problem. We first study the combinatorial structure for traffic arc sensor placement to achieve full network coverage without historical data in a given traffic network. Then, we present the relationship between the traffic sensor placement for full network coverage in the deterministic setting and for dynamic congestion area observation. A sampling approximation algorithm is developed to solve the problem with budget constraints. The paper also provides a number of illustrative examples to demonstrate the effectiveness of the proposed methodology.


Talk 1 of the invited session Wed.3.MA 141
"Algorithms and applications for stochastic programming" [...]
Cluster 22
"Stochastic optimization" [...]


  Florida Payday Loans can help you in trying times, but be sure to know the laws necessary for your loan application. In this section we give only a brief summary recommendation for admission of Levitra. Full information can be found in the instructions for receiving medications with vardenafil.