A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty

•Travel time uncertainty is incorporated into post-disaster assessment decisions.•A robust optimization approach with a coaxial uncertainty set is developed.•The benefits of using the coaxial uncertainty set are shown with examples.•A heuristic algorithm with a practical feasibility check method is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research 2020-04, Vol.282 (1), p.40-57
Hauptverfasser: Balcik, Burcu, Yanıkoğlu, İhsan
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•Travel time uncertainty is incorporated into post-disaster assessment decisions.•A robust optimization approach with a coaxial uncertainty set is developed.•The benefits of using the coaxial uncertainty set are shown with examples.•A heuristic algorithm with a practical feasibility check method is developed.•The heuristic attains high-quality solutions for hypothetical and case instances. We focus on rapid needs assessment operations conducted immediately after a disaster to identify the urgent needs of the affected community groups, and address the problem of selecting the sites to be visited by the assessment teams during a fixed assessment period and constructing assessment routes under travel time uncertainty. Due to significant uncertainties in post-disaster transportation network conditions, only rough information on travel times may be available during rapid needs assessment planning. We represent uncertain travel times simply by specifying a range of values, and implement robust optimization methods to ensure that each constructed route is feasible for all realizations of the uncertain parameters that lie in a predetermined uncertainty set. We present a tractable robust optimization formulation with a coaxial box uncertainty set due to its advantages in handling uncertainty in our selective assessment routing problem, in which the dimension of the uncertainty (number of arcs traversed) is implicitly determined. To solve the proposed model efficiently, we develop a practical method for evaluating route feasibility with respect to the robust route duration constraints, and embed this feasibility check procedure in a tabu search heuristic. We present computational results to evaluate the effectiveness of our solution method, and illustrate our approach on a case study based on a real-world post-disaster network.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2019.09.008