Probabilistic path queries in road networks: Traffic uncertainty aware path selection

Advances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2010, Pages 347-358

  Hua, Ming ^a   Pei, Jian ^b  

^a FACEBOOK   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE TRAVEL TIME; BEST FIRST SEARCH; CONSTANT FACTOR APPROXIMATION; EMPIRICAL STUDIES; EXACT ALGORITHMS; HEURISTIC EVALUATION FUNCTIONS; K-PATHS; PATH QUERIES; PATH SELECTION; PROBABILITY CALCULATIONS; QUERY EVALUATION; REAL ROAD NETWORKS; ROAD NETWORK; SAMPLING-BASED; SHORTEST PATH; SYNTHETIC DATASETS; TRAVEL TIME;

AIRPORTS; APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; DATABASE SYSTEMS; GRAPH THEORY; HEURISTIC METHODS; HOTELS; MOTOR TRANSPORTATION; RANDOM VARIABLES; ROADS AND STREETS; TECHNOLOGY; TRAFFIC SURVEYS; USER INTERFACES; WIRELESS SENSOR NETWORKS;

TREES (MATHEMATICS);

EID: 77952260420     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1739041.1739084     Document Type: Conference Paper

References (29)

1. D. Angluin and L. G. Valiant. Fast probabilistic algorithms for hamiltonian circuits and matchings. In STOC'77.
2. H. Bast et al. Transit: Ultrafast shortest-path queries with linear-time preprocessing. In C. Demetrescu et al. (editors). 9th DIMACS Implementation Challenge - Shortest Path, 2006.
3. H. Bast et al. In transit to constant time shortest-path queries in road networks. In ALENEX'07.
4. E. P. F. Chan and J. Zhang. A fast unified optimal route query evaluation algorithm. In CIKM'07.
5. A. Chang and E. Amir. Reachability under uncertainty. In UAI'07.
6. Y. Fan et al. Arriving on Time. CJ. Optimization Theory and Applications, 127(3):497-513, 2005.
7. Y. Fan et al., Shortest paths in stochastic networks with correlated link costs, Computers and Mathematics with Applications, vol. 49, no.9-10, pp. 1549-1564, 2005. (Pubitemid 41101303)
8. Y. Fan and Y. Nie. Optimal Routing for Maximizing the Travel Time Reliability. Networks and Spatial Economics, 6(3-4):333-344, 2006. (Pubitemid 44314624)
9. H. Frank. Shortest paths in probabilistic graphs. Operations Research, 17(4):583-599, 1969.
10. L. Fu et al. Heuristic shortest path algorithms for transportation applications: State of the art. Computers and Operations Research, 33(11):3324-3343, 2006.
11. J. Ghosh et al. On a routing problem within probabilistic graphs and its application to intermittently connected networks. In INFOCOM'07.
12. K. Goebel and A. M. Agogino. Sensor validation and fusion for automated vehicle control using fuzzy techniques. Journal of Dynamic Systems, Measurement, and Control, 123(1):145-146, 2001.
13. H. Gonzalez et al. Adaptive fastest path computation on a road network: a traffic mining approach. In VLDB'07.
14. M. T. Goodrich. Planar separators and parallel polygon triangulation. J. Comput. Syst. Sci., 51(3):374-389, 1995.
15. P. Hart et al. A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics, IEEE Transactions on, 4(2):100-107, July 1968.
16. R. R. He et al. Temporal and Spatial Variability of Travel Time. Center for Traffic Simulation Studies. Paper UCI-ITS-TS-02-14.
17. N. Jing et al. Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans. on Knowl. and Data Eng., 10(3):409-432, 1998.
18. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, Febuary 1970.
19. A. B. Kurzhanski and P. Varaiya. On reachability under uncertainty. SIAM J. Control Optim., 41(1):181-216, 2002.
20. R. P. Loui. Optimal paths in graphs with stochastic or multidimensional weights. Commun. ACM, 26(9):670-676, 1983.
21. E. Nikolova et al. Stochastic Shortest Paths Via Quasi-convex Maximization. In ESA'06.
22. A. Polus. A study of travel time and reliability on arterial routes . Transportation, 8(2):141-151, 1979.
23. D. D. M. L. Rasteiro and A. J. B. Anjo. Optimal paths in probabilistic networks. Journal of Mathematical Sciences, 120(1):974-987, 2004.
24. R. Righter. Scheduling. In Stochastic Orders and Their Applications, 1994.
25. H. Samet et al. Scalable network distance browsing in spatial databases. In SIGMOD'08.
26. P. Sanders and D. Schultes. Highway hierarchies hasten exact shortest path queries. In ESA'05.
27. P. Sanders and D. Schultes. Engineering highway hierarchies. In ESA'06.
28. Y. Tao and D. Papadias. Maintaining Sliding Window Skylines on Data Streams. In TKDE, vol. 18, no. 3, pp. 377-391, 2006.
29. Y. Wu et al. A shortest path algorithm based on hierarchical graph model. In Intelligent Transportation Systems, pages 1511-1514, 2003.