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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Accelerating the k-shortest paths computation in multimodal transportation networks


    Contributors:
    Lam, S.K. (author) / Srikanthan, T. (author)


    Publication date :

    2002-01-01


    Size :

    356468 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    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