Direct connectivity, the main principle of developing the Interstate highway system, is of reduced importance for track-based transport networks. Ultra-speed, enabled by innovative technologies, can transport passengers via indirect links fast enough that certain direct links can be strategically removed to achieve cost savings while maintaining target transit times. Few studies have investigated such network benefits associated with ultra-speed technologies, and the relationship of vehicle speed, track length, and travel time savings is not well understood. Therefore, this article quantifies the relationship by studying potential transport networks using a case study in the American Midwest. A graph-theory-based heuristic algorithm is proposed to generate the optimal network and a set of scenarios are analyzed to test the sensitivity of network benefits to speed. Results show that ultra-speed can reduce the total length of the transport network by almost 50% while offering over 50% travel time reduction. This first attempt at quantifying the network benefits sheds light on transport network planning and infrastructure project development by mitigating the problems of capital cost and land acquisition.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Network Planning for Innovative Track-Based Transportation Technologies: A Minimum Spanning Tree Algorithm to Demonstrate Network Benefits


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:
    Zhang, Dapeng (author) / Li, Yanning (author)


    Publication date :

    2022-08-08




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Small Quantities of Cargo Transportation Route Selection Base on Minimum Spanning Tree Algorithm

    Yu, Hong Yan ;Ke, Jin Long ;Li, Meng Ting | Trans Tech Publications | 2014


    Node Splitting Algorithm of R^*-Tree Based on Minimum Spanning Tree

    Sun, D. / Sun, Y. / Kang, X. et al. | British Library Online Contents | 2011



    Radar Data Tracking Using Minimum Spanning Tree-Based Clustering Algorithm

    Park, C. / Lee, H. / Musaffar, B. et al. | British Library Conference Proceedings | 2011


    Radar Data Tracking Using Minimum Spanning Tree-Based Clustering Algorithm

    Park, Chunki / Lee, Hak-tae / Musaffar, Bassam | AIAA | 2011