Metaheuristics for cleaning debris in urban networks after major disasters
Résumé
The problem focused in this study consists in scheduling work-troops to clean urban networks blocked by debris from collapsed buildings. We developed a dedicated local search, a greedy randomized adaptive search procedure (GRASP) and an iterated local search (ILS), which were tested against a set of theoretical instances and a large instance of Port-au-Prince, Haiti, after an earthquake in 2010.
Fichier principal
ROADEF_2022_Metaheuristics_for_cleaning_debris_in_urban_networks_after_major_disasters_.pdf (210.04 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|