A data-driven method for stochastic shortest path problem

2014 17th IEEE International Conference on Intelligent Transportation Systems, ITSC 2014

Volumn , Issue , 2014, Pages 1045-1052

  Cao, Zhiguang ^a,b   Guo, Hongliang ^b   Zhang, Jie ^b   Niyato, Dusit ^b   Fastenrath, Ulrich ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c BMW GROUP   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; INTEGER PROGRAMMING; INTELLIGENT SYSTEMS; INTELLIGENT VEHICLE HIGHWAY SYSTEMS; ROADS AND STREETS; TRAVEL TIME;

CARDINALITY PROBLEMS; DATA-DRIVEN APPROACH; INTEGER LINEAR PROGRAMMING; L1-NORM MINIMIZATIONS; MINIMIZATION PROBLEMS; REAL WORLD ROAD NETWORKS; STOCHASTIC SHORTEST PATH PROBLEM; TRAVEL TIME DISTRIBUTIONS;

STOCHASTIC SYSTEMS;

EID: 84937126905     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITSC.2014.6957826     Document Type: Conference Paper

References (30)

1. Y. Fan, R. Kalaba, and J. Moore II, "Arriving on time," Journal of Optimization Theory and Applications, Vol. 127, no. 3, pp. 497-513, 2005.
2. Y. Fan and Y. Nie, "Optimal routing for maximizing the travel time reliability," Networks and Spatial Economics, Vol. 6, no. 3-4, pp. 333-344, 2006.
3. E. D. Miller-Hooks and H. S. Mahmassani, "Least expected time paths in stochastic, time-varying transportation networks," Transportation Science, Vol. 34, no. 2, pp. 198-215, 2000.
4. B. C. Dean, "Algorithms for minimum-cost paths in time-dependent networks with waiting policies," Networks, Vol. 44, no. 1, pp. 41-46, 2004.
5. S. T. Waller and A. K. Ziliaskopoulos, "On the online shortest path problem with limited arc cost dependencies," Networks, Vol. 40, no. 4, pp. 216-227, 2002.
6. E. Nikolova, J. A. Kelner, M. Brand, and M. Mitzenmacher, "Stochastic shortest paths via quasi-convex maximization," in Algorithms-ESA 2006, pp. 552-563, Springer, 2006.
7. E. Nikolova, "Approximation algorithms for reliable stochastic combinatorial optimization," in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 338-351, Springer, 2010.
8. H. Frank, "Shortest paths in probabilistic graphs," Operations Research, Vol. 17, no. 4, pp. 583-599, 1969.
9. Y. M. Nie and X. Wu, "Shortest path problem considering on-time arrival probability," Transportation Research Part B: Methodological, Vol. 43, no. 6, pp. 597-613, 2009.
10. E. Nikolova, J. A. Kelner, M. Brand, and M. Mitzenmacher, "Stochastic shortest paths via quasi-convex maximization," in Algorithms-ESA 2006, pp. 552-563, Springer, 2006.
11. S. Lim, H. Balakrishnan, D. Gifford, S. Madden, and D. Rus, "Stochastic motion planning and applications to traffic," in Algorithmic Foundation of Robotics VIII, pp. 483-500, Springer, 2009.
12. J. G. Wardrop, "Road paper. some theoretical aspects of road traffic research.," in ICE Proceedings: Engineering Divisions, Vol. 1, pp. 325-362, Thomas Telford, 1952.
13. A. Polus, "A study of travel time and reliability on arterial routes," Transportation, Vol. 8, no. 2, pp. 141-151, 1979.
14. M. Mogridge and S. Fry, "Variability of car journey times on a particular route in central london," Traffic Engineering & Control, Vol. 25, no. HS-038 005, 1984.
15. F. Montgromery and A. May, "Factors affecting travel times on urban radial routes," Traffic engineering & control, Vol. 28, no. 9, 1987.
16. H. Rakha, I. El-Shawarby, M. Arafeh, and F. Dion, "Estimating path travel-time reliability," in Intelligent Transportation Systems Conference, 2006. ITSC'06. IEEE, pp. 236-241, IEEE, 2006.
17. K. Chen, L. Yu, J. Guo, and H. Wen, "Characteristics analysis of road network reliability in beijing based on the data logs from taxis," in Transportation Research Board 86th Annual Meeting, no. 07-1420, 2007.
18. B. M. Fastenrath Ulrich, "Process for selection of a route for a dynamic navigation on private transport," 2008.
19. S. P. Boyd and L. Vandenberghe, Convex optimization. Cambridge university press, 2004.
20. N. Kallus, "From predictions to data-driven decisions using machine learning," arXiv preprint arXiv:1402.5481, 2014.
21. I. H. Witten and E. Frank, Data Mining: Practical machine learning tools and techniques. Morgan Kaufmann, 2005.
22. D. Solomatine, "Applications of data-driven modelling and machine learning in control of water resources," Computational intelligence in control, pp. 197-217, 2002.
23. J. Cheng, S. Kosuch, and A. Lisser, "Stochastic shortest path problem with uncertain delays.," in ICORES, pp. 256-264, 2012.
24. M. J. Abdi, Cardinality optimization problems. PhD thesis, University of Birmingham, 2013.
25. Stanford University, L1-norm Methods for Convex-Cardinality Problems, 2008. http://www.youtube.com/watch?v=DsXzUU691ts.
26. MathWorks, Mixed-Integer Linear Programming Algorithms, 2014. http://www.mathworks.com/help/optim/ug/mixed-integer-linear-programming-algorithms.html.
27. Y. Zhang, "Solving large-scale linear programs by interior-point methods under the matlab environment," Optimization Methods and Software, Vol. 10, no. 1, pp. 1-31, 1998.
28. E. Danna, E. Rothberg, and C. Le Pape, "Exploring relaxation induced neighborhoods to improve mip solutions," Mathematical Programming, Vol. 102, no. 1, pp. 71-90, 2005.
29. G. L. Nemhauser and L. A. Wolsey, Integer and combinatorial optimization, Vol. 18. Wiley New York, 1988.
30. W. Hoeffding, "Probability inequalities for sums of bounded random variables," Journal of the American statistical association, Vol. 58, no. 301, pp. 13-30, 1963.