Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Spatio-temporal NetworksShortest Path Algorithms for a Fixed Start Time

Spatio-temporal Networks: Shortest Path Algorithms for a Fixed Start Time [Shortest path computation is an important query on any network. In a spatio-temporal network, this computation assumes added semantics due to the dependence of network attributes on time. Shortest paths can be computed either for a given start time or to find the start time and the path that leads to least travel time journeys (best start time journeys). Developing efficient algorithms for computing shortest paths in a time varying spatial network is challenging because these journeys do not always display greedy property or optimal substructure. This chapter describes algorithms to compute shortest paths for a given start time. The formulations of shortest path algorithms can also depend on the properties of the network parameters such as travel times. For example, the algorithm can significantly vary depending on whether the travel times follow FIFO property or not. The chapter provides algorithms for both FIFO and non-FIFO travel times.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Spatio-temporal NetworksShortest Path Algorithms for a Fixed Start Time

Download PDF
19 pages

Loading next page...
 
/lp/springer-journals/spatio-temporal-networks-shortest-path-algorithms-for-a-fixed-start-j09ZKTYLWA
Publisher
Springer New York
Copyright
© The Author(s) 2013
ISBN
978-1-4614-4917-1
Pages
25 –43
DOI
10.1007/978-1-4614-4918-8_3
Publisher site
See Chapter on Publisher Site

Abstract

[Shortest path computation is an important query on any network. In a spatio-temporal network, this computation assumes added semantics due to the dependence of network attributes on time. Shortest paths can be computed either for a given start time or to find the start time and the path that leads to least travel time journeys (best start time journeys). Developing efficient algorithms for computing shortest paths in a time varying spatial network is challenging because these journeys do not always display greedy property or optimal substructure. This chapter describes algorithms to compute shortest paths for a given start time. The formulations of shortest path algorithms can also depend on the properties of the network parameters such as travel times. For example, the algorithm can significantly vary depending on whether the travel times follow FIFO property or not. The chapter provides algorithms for both FIFO and non-FIFO travel times.]

Published: Sep 5, 2012

Keywords: Travel Time; Short Path; Start Time; Short Path Algorithm; Greedy Strategy

There are no references for this article.