Route planning in dynamic graphs with linear changing and preprocessing for speed-up

The goal of this paper is to work out a concept for route planning in a road network, where the costs of roads are not constant, but changing in a linear way. The solution developed is based on the classical Dijkstra's algorithm, which helps to find the route with minimal cost. The new algorithm takes the varying into account in order to find out the best route. This search refers not only to a moment of the departure but to the whole duration of the travel. A speed-up technique has been developed for preprocessing before run time. This preprocessing phase helps to give back the route with minimal cost for the user quickly in run time query. A numerical example has been presented to show the detailed steps of the algorithm and the speed-up technique.

[1]  Daniele Frigioni,et al.  Fully dynamic shortest paths in digraphs with arbitrary arc weights , 2003, J. Algorithms.

[2]  Peter Sanders,et al.  Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.

[3]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[4]  Sebastian Thrun,et al.  Anytime search in dynamic graphs , 2008, Artif. Intell..

[5]  Giuseppe F. Italiano,et al.  Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures , 2006, J. Discrete Algorithms.

[6]  Dorothea Wagner,et al.  Landmark-Based Routing in Dynamic Graphs , 2007, WEA.

[7]  Giuseppe F. Italiano,et al.  Fully dynamic all pairs shortest paths with real edge weights , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[8]  Rolf H. Möhring,et al.  Fast Point-to-Point Shortest Path Computations with Arc-Flags , 2006, The Shortest Path Problem.

[9]  Ronald J. Gutman,et al.  Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.

[10]  Peter Matis,et al.  Decision Support System for Solving the Street Routing Problem , 2008 .

[11]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[12]  Vaclovas Bagdonas,et al.  City transport monitoring and routes optimal management system , 2008 .

[13]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[14]  Peter Sanders,et al.  Engineering highway hierarchies , 2012, JEAL.

[15]  Ain Kiisler.  Logistics in Estonian Business Companies , 2008 .

[16]  Rolf H. Möhring,et al.  Partitioning Graphs to Speed Up Dijkstra's Algorithm , 2005, WEA.

[17]  Daniele Frigioni,et al.  A fully dynamic algorithm for distributed shortest paths , 2003, Theor. Comput. Sci..