The hub nodes in transportation network have great influences on the connectivity, reliability and safety of the entire network. However, most of the currentresearch only consider the structure of transportation network and neglect the traffic-related factors. Thus, present study proposes hub nodes mining algorihm that combines traffic flow feature and Betweenness centrality, the importance of the node is related to the Betweenness of nodes, the traffic flow, and the grade of the connected road. Moreover, it introduced fast algorithm Ulrik Brandes reduce the complexity of calculation. The results of the simulation indicate that the proposed algorithm can mining hub nodes effectively in the road network including bridge nodes. The findings of this paper can be applied to provide decision-making support for the management of transportation network and the optimization of traffic construction


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Mining Hub Nodes Based on Fast Brandes Betweenness Centrality in a Weighted Complex Transportation Network


    Contributors:
    Liu, Tao (author) / Liu, Weiyan (author) / Chen, Jun (author)


    Publication date :

    2022-08-01


    Size :

    4798290 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Augmented Betweenness Centrality for Environmentally Aware Traffic Monitoring in Transportation Networks

    Puzis, Rami / Altshuler, Yaniv / Elovici, Yuval et al. | Taylor & Francis Verlag | 2013



    Betweenness Centrality Measures as Potential Predictors of Crash Frequency

    Nair, Shilpa R. / Abhiram, Manoj K. V. / Bhavathrathan, B. K. | Springer Verlag | 2024


    Betweenness Centrality Measures as Potential Predictors of Crash Frequency

    Nair, Shilpa R. / Abhiram, Manoj K. V. / Bhavathrathan, B. K. | Springer Verlag | 2024