Arc routing problems to restore connectivity of a road network
•We study two arc routing problems to clear blocked roads and achieve connectivity.•We develop MIP formulations and Variable Neighborhood Search heuristics.•A computational study is conducted on a case of Istanbul and additional instances.•The heuristics can be used to support road clearance decisio...
Gespeichert in:
Veröffentlicht in: | Transportation research. Part E, Logistics and transportation review Logistics and transportation review, 2016-11, Vol.95, p.177-206 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | •We study two arc routing problems to clear blocked roads and achieve connectivity.•We develop MIP formulations and Variable Neighborhood Search heuristics.•A computational study is conducted on a case of Istanbul and additional instances.•The heuristics can be used to support road clearance decisions in disaster response.
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. |
---|---|
ISSN: | 1366-5545 1878-5794 |
DOI: | 10.1016/j.tre.2016.09.012 |