1-minimization method for link flow correction

Penghang Yin Zhe Sun Wen-Long Jin Jack Xin

Analysis of PDEs mathscidoc:1912.43905

Transportation Research Part B: Methodological, 104, 398-408, 2017.10
A computational method, based on <sub>1</sub>-minimization, is proposed for the problem of link flow correction, when the available traffic flow data on many links in a road network are inconsistent with respect to the flow conservation law. Without extra information, the problem is generally ill-posed when a large portion of the link sensors are unhealthy. It is possible, however, to correct the corrupted link flows accurately with the proposed method under a recoverability condition if there are only a few bad sensors which are located at certain links. We analytically identify the links that are robust to miscounts and relate them to the geometric structure of the traffic network by introducing the recoverability concept and an algorithm for computing it. The recoverability condition for corrupted links is simply the associated recoverability being greater than 1. In a more realistic setting, besides the unhealthy link sensors, small
No keywords uploaded!
[ Download ] [ 2019-12-24 21:05:48 uploaded by Jack_Xin ] [ 707 downloads ] [ 0 comments ]
  title={1-minimization method for link flow correction},
  author={Penghang Yin, Zhe Sun, Wen-Long Jin, and Jack Xin},
  booktitle={Transportation Research Part B: Methodological},
Penghang Yin, Zhe Sun, Wen-Long Jin, and Jack Xin. 1-minimization method for link flow correction. 2017. Vol. 104. In Transportation Research Part B: Methodological. pp.398-408. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191224210548408147469.
Please log in for comment!
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved