After a disaster, restoring accessibility in the affected area is critical for response operations. We study two arc routing problems for clearing blocked roads. The first problem minimizes the time to reconnect the road network, while the second maximizes the total benefit gained by reconnecting network components within a time limit. For each problem, we develop a mixed integer programming formulation and two versions of a heuristic algorithm. We conduct computational experiments on Istanbul data and instances adapted from the literature. The heuristics achieve near-optimal or optimal solutions quickly in most of the tested instances.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Arc routing problems to restore connectivity of a road network


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    2016




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch



    Klassifikation :

    BKL:    85.00 / 55.82 Güterverkehr




    Dynamic routing based on road connectivity for urban vehicular environments

    Brahmi, N. / Boussedjra, M. / Mouzna, J. et al. | IEEE | 2009


    Distributed road network connectivity calculation method

    SHI ZHENGYUAN / KANG HAOHUA | Europäisches Patentamt | 2025

    Freier Zugriff


    OFF-ROAD ROUTING

    SJÖBERG JOHAN / SKILLSÄTER CALLE | Europäisches Patentamt | 2025

    Freier Zugriff