Dijkstra's algorithm is considered for the single source single target shortest path problem in large sparse graphs. The goal is to reduce the response time for on-line queries by using precomputed information. Due to the size of the graph, preprocessing space requirements can be only linear in the number of nodes. It is assumed that a layout of the graph is given. In the preprocessing, It is determined from this layout a geometric object for each edge containing all nodes that can be reached by a shortest path starting with that edge. Based on these geometric objects, the search space for on-line computation can be reduced significantly. Shortest path queries can then be answered by Dijkstra's algorithm restricted to edges where the corresponding geometric object contains the target. It is presented an extensive experimental study comparing the impact of different types of objects. The test data are real-world traffic networks, the typical field of application für this scenario. Furthermore, new algorithms are presented as well as an empirical study for the dynamic case of this problem, where edge weights are subject to change and the geometric containers have to be updated. The quality and the time for different update strategies are evaluated that guarantee correct shortest paths. Finally, a software framework is presented in C++ to realise the implementations of all of our variants of Dijkstra's algorithm. A basic implementation of the algorithm is refined for each modification and - even more importantly - these modifications can be combined in any possible way without loss of efficiency.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Geometric shortest path containers


    Additional title:

    Der geometrisch kürzeste Lieferweg


    Contributors:


    Publication date :

    2004


    Size :

    23 Seiten, 6 Bilder, 1 Tabelle, 48 Quellen



    Type of media :

    Report


    Type of material :

    Print


    Language :

    English




    Urban K shortest path obtaining method based on shortest path tree

    DING JIANXUN / YANG BEINUO / DUAN RUI et al. | European Patent Office | 2024

    Free access

    Shortest path using detour heuristic algorithm

    Wu, Shu-Hui / Wang, Shu-Jen / Tai, Chien-Ting et al. | Tema Archive | 1999


    The Variance-Constrained Shortest Path Problem

    Sivakumar, Raj A. | Online Contents | 1994


    A directionally oriented shortest path algorithm

    Butas, Larry F. | Elsevier | 1968