This article describes an original shortest path algorithm for graphs representing a real road network. We test the influence of a coefficient weighing the evaluated distance used in such short path algorithms. This coefficient has an influence on the performance of the shortest path algorithm which uses the evaluated distance as heuristic. We try to provide a better algorithm using this heuristic and we test its evaluation in various situations. The results presented in this paper are used to write new shortest path algorithms for large real road networks. To conclude, we experiment this algorithm and some alternatives in various situations.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Improvement of a Shortest Routes Algorithm


    Contributors:


    Publication date :

    2007-09-01


    Size :

    817248 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Shortest Routes between Sets on Gray-Level Surfaces

    Ikonen, L. / Toivanen, P. | British Library Online Contents | 2005



    High Performance Computation of Shortest Routes for Intelligent Transportation Systems Applications

    Chabini, I. / Florian, M. / LeSaux, E. | British Library Conference Proceedings | 1995


    Shortest routes on varying height surfaces using gray-level distance transforms

    Ikonen, L. / Toivanen, P. | British Library Online Contents | 2005


    Parallel and Distributed Computation of Shortest Routes and Network Equilibrium Models

    Florian, M. / Chabini, I. / Le Saux, E. et al. | British Library Conference Proceedings | 1997