Algorithms to determine shortest paths in a network have been studied since the sixties. In this article we discuss recent developments in this field, based on a study of the literature. We compare the performance of the various algorithms. These comparisons are mainly based on tests on real‐life transportation networks.

    Although the basic form of path finding methods has remained largely the same over the years, it appears that in the last decade considerable improvements have been made in the implementation of the algorithms. These developments provide us with both faster and more robust algorithms.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Recent developments in path finding algorithms: a review


    Contributors:

    Published in:

    Publication date :

    1988-07-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Recent developments in Marconi-Adcock direction finding

    Smith, S.B. / Hatch, G.F. | Engineering Index Backfile | 1936




    Schedule-Based Path-Finding Algorithms for Transit Trip-Planning Systems

    Huang, R. / Peng, Z.-R. / Transportation Research Board | British Library Conference Proceedings | 2002


    Special Issue on Recent Developments in Bioinspired Algorithms

    Jourdan, L. / Talbi, E. G. | British Library Online Contents | 2010