Show simple item record

dc.contributor.authorDemange, Marc
dc.contributor.authorGabrel, Virginie
dc.contributor.authorHaddad, Marcel Adonis
dc.contributor.authorMurat, Cécile
dc.date.accessioned2020-07-01T11:27:31Z
dc.date.available2020-07-01T11:27:31Z
dc.date.issued2020
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/20902
dc.language.isoenen
dc.subjectp-Centeren
dc.subjectsheltersen
dc.subjectwildfiresen
dc.subject.ddc005en
dc.titleA robust p-Center Problem under Pressure to locate Shelters in Wildfire Contexten
dc.typeDocument de travail / Working paper
dc.description.abstractenThe location of shelters in different areas threatened by wildfires is one of the possible ways to reduce fatalities in a context of an increasing number of catastrophic and severe wildfires. These shelters will enable the population in the area to be protected in case of fire outbreaks. The subject of our study is to determine the best place for shelters in a given territory. The territory, divided into zones, is represented by a graph in which eachzone corresponds to a node and two nodes are linked by an edge if it is feasible to go directly from one zone to the other. The problem is to locate p shelters on nodes so that the maximum distance of any node to its nearest shelter is minimized. When the uncertainty of fire outbreaks is not considered, this problem corresponds to the well-known p-Center problem on a graph. In this article, the uncertainty of fire outbreaks is introduced taking into account a finite set of fire scenarios. A scenario defines a fire outbreak on a single zone with the main consequence of modifying evacuation paths. Several evacuation paths may become impracticable and the ensuing evacuation decisions made under pressure may no longer be rational. In this context, the new issue under consideration is to place p shelters on a graph so that the maximum evacuation distance of any node to its nearest shelter in any scenario is minimized. We refer to this problem as the Robust p-Center problem under Pressure. After proving the NP-hardness of this problem on subgraphs of grids, we propose a first formulation based on 0-1 Linear Programming. For real size instances, the sizes of the 0-1 Linear Programs are huge and we propose a decomposition scheme to solve them exactly. Experimental results outline the efficiency of our approach.en
dc.publisher.cityParisen
dc.relation.ispartofseriestitlePreprint Lamsadeen
dc.identifier.urlsitehttps://hal.archives-ouvertes.fr/hal-02749732en
dc.subject.ddclabelProgrammation, logiciels, organisation des donnéesen
dc.description.ssrncandidatenonen
dc.description.halcandidatenonen
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.date.updated2020-07-01T11:23:15Z
hal.person.labIds
hal.person.labIds989
hal.person.labIds989
hal.person.labIds989


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record