Intermodality in transportation systems is fast becoming a research topic of great interest. The computation of multiple paths in a multimodal network is desirable to identify efficient routes based on user preferences. This paper describes the clustering technique, which improves the performance of conventional k-shortest paths computations in multimodal transportation networks by first transforming the network into an acyclic representation through identification of cycles and clustering them into hypothetical nodes. The generalized Floyd algorithm is then applied on these clusters to compute the k-shortest paths. Simulation results show that the proposed technique significantly improves the performance of the conventional algorithm, particularly when the required number of k-shortest paths increases.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Accelerating the k-shortest paths computation in multimodal transportation networks


    Beteiligte:
    Lam, S.K. (Autor:in) / Srikanthan, T. (Autor:in)


    Erscheinungsdatum :

    01.01.2002


    Format / Umfang :

    356468 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    ACCELERATING THE K-SHORTEST PATHS COMPUTATION IN MULTIMODAL TRANSPORTATION NETWORKS

    Lam, S. K. / Srikanthan, T. / IEEE | British Library Conference Proceedings | 2002



    Finding the best multimodal paths in urban transportation networks

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



    Shortest paths in traffic-light networks

    Chen, Yen-Liang | Online Contents | 2000