Cellpath: Fusion of cellular and traffic sensor data for route flow estimation via convex optimization

被引:23
作者
Wu, Cathy [1 ]
Thai, Jerome [1 ]
Yadlowsky, Steve [1 ]
Pozdnoukhov, Alexei [2 ]
Bayen, Alexandre [1 ,2 ,3 ]
机构
[1] Univ Calif Berkeley, Elect Engn & Comp Sci, Berkeley, CA 94720 USA
[2] Univ Calif Berkeley, Civil & Environm Engn, Berkeley, CA 94720 USA
[3] Univ Calif Berkeley, ITS, Berkeley, CA 94720 USA
基金
美国国家科学基金会;
关键词
Route flow estimation; Cellular network data; Convex optimization; Traffic assignment; Simplex constraints; Isotonic regression; EQUILIBRIUM; INFORMATION; ALGORITHMS;
D O I
10.1016/j.trc.2015.05.004
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
A new convex optimization framework is developed for the route flow estimation problem from the fusion of vehicle count and cellular network data. The issue of highly underdetermined link flow based methods in transportation networks is investigated, then solved using the proposed concept of cellpaths for cellular network data. With this data-driven approach, our proposed approach is versatile: it is compatible with other data sources, and it is model agnostic and thus compatible with user equilibrium, system-optimum, Stackelberg concepts, and other models. Using a dimensionality reduction scheme, we design a projected gradient algorithm suitable for the proposed route flow estimation problem. The algorithm solves a block isotonic regression problem in the projection step in linear time. The accuracy, computational efficiency, and versatility of the proposed approach are validated on the I-210 corridor near Los Angeles, where we achieve 90% route flow accuracy with 1033 traffic sensors and 1000 cellular towers covering a large network of highways and arterials with more than 20,000 links. In contrast to long-term land use planning applications, we demonstrate the first system to our knowledge that can produce route-level flow estimates suitable for short time horizon prediction and control applications in traffic management. Our system is open source and available for validation and extension. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:111 / 128
页数:18
相关论文
共 55 条
[31]   EFFICIENT APPROACH TO SOLVING ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM [J].
LEBLANC, LJ ;
MORLOK, EK ;
PIERSKALLA, WP .
TRANSPORTATION RESEARCH, 1975, 9 (05) :309-318
[32]   A probit-based stochastic user equilibrium assignment model [J].
Maher, MJ ;
Hughes, PC .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1997, 31 (04) :341-355
[33]  
Mardani M., 2013, IEEE INT C AC SPEECH
[34]  
Mathew J., 2014, International Journal of Research in Engineering and Technology, V3, P97
[35]   Potential games [J].
Monderer, D ;
Shapley, LS .
GAMES AND ECONOMIC BEHAVIOR, 1996, 14 (01) :124-143
[36]  
Nocedal J, 2006, SPRINGER SER OPER RE, P1, DOI 10.1007/978-0-387-40065-5
[37]  
Ortuzar J.D., 2001, MODELLING TRANSPORT, V3rd
[38]  
Patire A., 2013, TRANSP RES C
[39]   Path inference from sparse floating car data for urban networks [J].
Rahmani, Mahmood ;
Koutsopoulos, Hans N. .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2013, 30 :41-54
[40]   The price of anarchy is independent of the network topology [J].
Roughgarden, T .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (02) :341-364