For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks


    Weitere Titelangaben:

    Transportation Research Record


    Beteiligte:


    Erscheinungsdatum :

    1998-01-01




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Heuristic Search for the Best Paths in an Intermodal Transportation System

    Di Febbraro, A. / Pasqui, L. / Sacone, S. et al. | British Library Conference Proceedings | 1997


    Finding the best multimodal paths in urban transportation networks

    Di Febbraro, A. / Sacone, S. / International Federation of Automatic Control | British Library Conference Proceedings | 1997


    Heuristic search for the best paths in an intermodal tranportation system

    Febbraro, A. DI / Pasqui, S. / Sacone, S. et al. | Tema Archiv | 1997