We introduce the multicommodity maximal covering network design problem (MCNDP) in the context of determining critical routes for earthquake management. We seek low cost routes that cover the maximum population while satisfying budget constraints introduced by the need to retrofit bridges on the critical routes. The MCNDP seeks the subnetwork that minimizes the total routing cost and maximizes the total demand covered for a pre-determined set of origin-destination (O-D) pairs subject to budget constraints. An integer programming formulation of the MCNDP is presented. It is applied to an earthquake management problem in southwestern Indiana. Insights on the model are illustrated by evaluating the tradeoffs between the two objectives over a range of budget values.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The multicommodity maximal covering network design problem


    Beteiligte:
    Viswanath, K. (Autor:in) / Peeta, S. (Autor:in)


    Erscheinungsdatum :

    2002-01-01


    Format / Umfang :

    417759 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    THE MULTICOMMODITY MAXIMAL COVERING NETWORK DESIGN PROBLEM

    Viswanath, K. / Peeta, S. / IEEE | British Library Conference Proceedings | 2002


    Multicommodity Maximal Covering Network Design Problem for Planning Critical Routes for Earthquake Response

    Viswanath, Kannan / Peeta, Srinivas | Transportation Research Record | 2003



    The congested multicommodity network design problem

    Paraskevopoulos, Dimitris C. / Gürel, Sinan / Bektaş, Tolga | Elsevier | 2015


    The congested multicommodity network design problem

    Dimitris C Paraskevopoulos | Online Contents | 2016