Shortest paths in time-dependent FIFO networks using edge load forecasts

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2009, Pages 1-6

  Dehne, Frank ^a   Omran, Masoud T ^a   Sack, Jörg Rüdiger ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION METHODS; DESTINATION NODES; EARLIEST ARRIVAL; EDGE LOADS; FIFO PROPERTY; INPUT SIZE; POLYNOMIAL SIZE; POLYNOMIAL-TIME; SHORTEST PATH; TIME-DEPENDENT; TIME-DEPENDENT NETWORKS;

ELECTRIC LOAD FORECASTING; GEOGRAPHIC INFORMATION SYSTEMS; POLYNOMIAL APPROXIMATION; WIRELESS SENSOR NETWORKS;

ALGORITHMS;

EID: 74049154206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645373.1645374     Document Type: Conference Paper

References (16)

1. Ravindra K. Ahuja, James B.Orlin, Stefano Pallottino, and Maria G.Scutella. Dynamic shortest paths minimizing travel times and costs. Networks, 41:205, 2001.
2. Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, and Maria Grazia Scutellà. Minimum time and minimum cost-path problems in street networks with periodic traffic lights. Transportation Science, 36(3):326-336, 2002.
3. Richard Bellman. On a routing problem. Quarterly of Applied Mathematics, 16:87-90, 1958.
4. Gerth Stølting Brodal and Riko Jacob. Time-dependent networks as models to achieve fast exact time-table queries. Electr. Notes Theor. Comput. Sci., 92:3-15, 2004.
5. Patricia June Carstensen. The complexity of some problems in parametric linear and combinatorial programming. PhD thesis, University of Michigan, 1983.
6. Hae Don Chon, Divyakant Agrawal, and Amr El Abbadi. Fates: Finding a time dependent shortest path. In MDM '03: Proceedings of the 4th International Conference on Mobile Data Management, pages 165-180, London, UK, 2003. Springer-Verlag.
7. K. L. Cooke and E. Halsey. The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications, 14(3):493-498, 1966.
8. Carlos F. Daganzo. Reversibility of the time-dependent shortest path problem. Transportation Research Part B: Methodological, 36(7):665-668, August 2002.
9. Brian C. Dean. Shortest paths in FIFO time-dependent networks: Theory and algorithms. Technical report, MIT Department of Computer Science, 2004.
10. Frank. Dehne, Masoud T. Omran, and Jorg-R. Sack. Minimum travel time on networks with time-dependent edge availabilities. Technical report, Carleton University, Ottawa, 2009.
11. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1(1):269-271, December 1959.
12. Bolin Ding, Jeffrey Xu Yu, and Lu Qin. Finding time-dependent shortest paths over large graphs. In EDBT '08: Proceedings of the 11th international conference on Extending database technology, pages 205-216, New York, NY, USA, 2008. ACM.
13. Michael L. Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596-615, 1987.
14. Monika Rauch Henzinger, Philip N. Klein, Satish Rao, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci., 55(1):3-23, 1997.
15. Ariel Orda and Raphael Rom. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM, 37(3):607-625, 1990.
16. Micha Sharir and Pankaj K. Agarwal. Davenport-Schinzel sequences and their geometric applications. Cambridge University Press, New York, NY, USA, 1996.