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.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Weitere Titelangaben:

    Transportation Research Record


    Beteiligte:
    Zhang, Yufeng (Autor:in) / Khani, Alireza (Autor:in)


    Erscheinungsdatum :

    2020-02-02




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Transportation network design for maximizing space–time accessibility

    Tong, Lu / Zhou, Xuesong / Miller, Harvey J. | Elsevier | 2015


    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