Providing Reliable Route Guidance: A Case Study Using Chicago Data

作者: Yu Nie , Peter C Nelson Ph.D. , Xing Wu , John Dillenburg

DOI:

关键词: Mathematical optimizationLinear regressionReliability (computer networking)EngineeringShortest path problemA priori and a posterioriConstruct (python library)Component (UML)SimulationTravel timeDiscretization

摘要: Reliable route guidance can be generated from solving the reliable a priori shortest path problem, which finds paths that maximize probability of arriving on time. This paper aims to demonstrate usefulness and feasibility such using case study. A hybrid discretization approach is first developed improve efficiency in computing convolution integral, an important time-consuming component routing algorithm. Methods construct link travel time distributions are discussed implemented with data Particularly, arterial streets estimated linear regression models calibrated freeway data. Numerical experiments optimal substantially affected by reliability requirement rush hours, could generate up 10 - 20 % savings. The study also verifies existing algorithms solve large-scale problems modest computational resources.

参考文章(32)
Yu Marco Nie, Xing Wu, Reliable a Priori Shortest Path Problem with Limited Spatial and Temporal Dependencies Proceedings of the 18th International Symposium on Transportation and Traffic Theory. pp. 169- 195 ,(2009) , 10.1007/978-1-4419-0820-9_9
William R Russell, Josef Hadar, Rules for Ordering Uncertain Prospects The American Economic Review. ,vol. 59, pp. 25- 34 ,(1969)
Liping Fu, An adaptive routing algorithm for in-vehicle route guidance systems with real-time information Transportation Research Part B-methodological. ,vol. 35, pp. 749- 765 ,(2001) , 10.1016/S0191-2615(00)00019-9
Peter Hart, Nils Nilsson, Bertram Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths IEEE Transactions on Systems Science and Cybernetics. ,vol. 4, pp. 100- 107 ,(1968) , 10.1109/TSSC.1968.300136
Y.Y. Fan, R.E. Kalaba, J.E. Moore, Shortest paths in stochastic networks with correlated link costs Computers & Mathematics With Applications. ,vol. 49, pp. 1549- 1564 ,(2005) , 10.1016/J.CAMWA.2004.07.028
John S. Croucher, A note on the stochastic shortest-route problem Naval Research Logistics Quarterly. ,vol. 25, pp. 729- 732 ,(1978) , 10.1002/NAV.3800250415
Amir Eiger, Pitu B. Mirchandani, Hossein Soroush, Path Preferences and Optimal Paths in Probabilistic Networks Transportation Science. ,vol. 19, pp. 75- 84 ,(1985) , 10.1287/TRSC.19.1.75
Ronald Prescott Loui, Optimal paths in graphs with stochastic or multidimensional weights Communications of the ACM. ,vol. 26, pp. 670- 676 ,(1983) , 10.1145/358172.358406
Elise Miller-Hooks, Hani S. Mahmassani, OPTIMAL ROUTING OF HAZARDOUS MATERIALS IN STOCHASTIC, TIME-VARYING TRANSPORTATION NETWORKS Transportation Research Record. ,vol. 1645, pp. 143- 151 ,(1998) , 10.3141/1645-18
R. Montemanni, L.M. Gambardella, An exact algorithm for the robust shortest path problem with interval data Computers & Operations Research. ,vol. 31, pp. 1667- 1680 ,(2004) , 10.1016/S0305-0548(03)00114-X