Algorithm for time-dependent shortest safe path on transportation networks

Procedia Computer Science

Volumn 4, Issue , 2011, Pages 958-966

  Jigang, Wu ^a   Jin, Song ^b   Ji, Haikun ^b   Srikanthan, Thambipillai ^c  

^a TIANJIN POLYTECHNIC UNIVERSITY   (China)

^b PEKING UNIVERSITY   (China)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Algorithm; Dynamic network; Shortest path; Time dependent; Transportation system

Indexed keywords

APPROXIMATE SOLUTION; DEPARTURE TIME; DESTINATION NODES; DIJKSTRA'S ALGORITHMS; DYNAMIC NETWORK; EFFICIENT ALGORITHM; HEAVY TRUCK; OPTIMAL SOLUTIONS; SHORTEST PATH; SHORTEST PATH PROBLEM; SOURCE NODES; SPEED-UPS; TIME DEPENDENT; TIME-DEPENDENT NETWORKS; TRANSPORTATION NETWORK; TRANSPORTATION SYSTEM; TYPICAL APPLICATION; UPPER BOUND;

GRAPH THEORY; MATERIALS HANDLING; TRANSPORTATION ROUTES; TRUCK TRANSPORTATION; WIRELESS SENSOR NETWORKS;

ALGORITHMS;

EID: 79958287373     PISSN: None     EISSN: 18770509     Source Type: Conference Proceeding    
DOI: 10.1016/j.procs.2011.04.101     Document Type: Conference Paper

References (17)

1. E. Dijkstra. A note two problems in connection with graphs. Numerical Math., 1959, vol. 1, pp. 269-271.
2. S. E. Dreyfus. An appraisal of some shortest-path algorithms. Operations Research, 1969, 17(3), pp. 395-412.
3. R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan, Faster algorithms for the shortest path problem, Journal of the ACM, 1990, 37(2), pp. 213-223. (Pubitemid 20696133)
4. M. Thorup, Undirected single-source shortest paths with positive integer weights in linear time, Journal of the ACM, 1999, 46(3), pp. 362-394.
5. P. Narvez, K.-Y. Siu, and H.-Y. Tzeng, New dynamic algorithms for shortest path tree computation, IEEE/ACM Trans. Netw., 2000, 8(6), pp. 734-746. (Pubitemid 32226992)
6. P. Narvez, K.-Y. Siu, and H.-Y. Tzeng, New dynamic SPT algorithm based on a ball-and-string model, IEEE/ACM Trans. Netw., 2001, 9(6), pp. 706-718. (Pubitemid 34099651)
7. K. Sung, M. G. Bell, M. Seong, and S. Park, Shortest paths in a network with time-dependent flow speeds, European Journal of Operational Research, 2000, 121(12), pp. 32-39. (Pubitemid 30546342)
8. A. Orda and R. Rom, Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length, Journal of the ACM, 1990, 37(3), pp. 607-625. (Pubitemid 20723071)
9. E. Kanoulas, Y. Du, T. Xia, and D. Zhang, Finding fastest paths on a road network with speed patterns. In Proc. of the 22nd International Conference on Data Engineering, 2006, pp. 10-19.
10. N. Jing, Y.-W. Huang, and E. A. Rundensteiner, Hierarchical optimization of optimal path finding for transportation applications, In Proc. Of ACM Conference on Information and Knowledge Management, 1996, pp. 261-268.
11. N. Jing, Y.-W. Huang, and E. A. Rundensteiner, Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation, IEEE Trans. Knowl. Data Eng., 1998, 10(3), pp. 409-432. (Pubitemid 128749991)
12. S. Jung and S. Pramanik, Hiti graph model of topographical roadmaps in navigation systems, In Proc. of the 12th International Conference on Data Engineering 1996, pp. 76-84.
13. G. R. Jagadeesh, T. Srikanthan, Route Computation in Large Road Networks: A Hierarchical Approach, IET Intelligent Transport Systems, 2008, 2(3), pp.219-227.
14. G. R. Jagadeesh, T. Srikanthan and K. H. Quek, Heuristic techniques for accelerating hierarchical routing on road networks, IEEE Transactions on Intelligent Transportation Systems, 2002, 3(4), pp. 301-309.
15. D. Bolin and Y. J. Xu and Q. Lu, Finding time-dependent shortest paths over large graphs, in Proceedings of the 11th international conference on Extending database technology, France, March 2008, pp. 205-216.
16. D. E. Kaufman, R. L. Smith, Fastest Paths in Time-Dependent Networks for Intelligent Vehicle-Highway Systems Application, Journal of Intelligent Transportation Systems, 1993, 1(1), pp. 1-11.
17. A. Orda, R. Rom, Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length, Journal of the ACM, 1990, 37(3), pp. 607-625. (Pubitemid 20723071)