A significant amount of research has been performed on network accessibility evaluation, but studies on incorporating accessibility maximization into network design problems have been relatively scarce. This study aimed to bridge the gap by proposing an integer programming model that explicitly maximizes the number of accessible opportunities within a given travel time budget. We adopted the Lagrangian relaxation method for decomposing the main problem into three subproblems that can be solved more efficiently using dynamic programming. The proposed method was applied to several case studies, which identified critical links for maximizing network accessibility with limited construction budget, and also illustrated the accuracy and efficiency of the algorithm. This method is promisingly scalable as a solution algorithm for large-scale accessibility-oriented network design problems.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Identifying Critical Links in Transportation Network Design Problems for Maximizing Network Accessibility


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2020-02-02




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Identifying critical links using network capacity-based indicator in multi-modal transportation networks

    Du, Muqing / Jiang, Xiaowei / Chen, Anthony | Taylor & Francis Verlag | 2022



    Freight Transportation Network Design Problem for Maximizing throughput under Uncertainty

    Unnikrishnan, Avinash / Waller, S. Travis | Transportation Research Record | 2009


    Disruptions in Megaregional Network Evacuations: Identifying and Assessing Critical Links

    Shapouri, Mohammad / Fuller, James D / Wolshon, Brian et al. | Transportation Research Record | 2023