M. Albareda-Sambola, O. Lordan
In the problem addressed in this work, a maximum of p facilities must be located on vertices of a given undirected graph G=(N, E) in order to provide service to all the graph nodes. However, it is assumed that the graph edges are unreliable, and, therefore, once the system is in operation, some edges may fail. Depending on the set of failing edges in a particular scenario, the original graph might be split into several connected components. We will say that a given node is covered in a particular scenario if its connected component contains at least one facility.
Assuming that the probability distribution governing the edge failures is known, the p-Maximum Expected Covering Problem (p-MEC) aims at identifying the p nodes where facilities should be located so as to maximize the expected number of covered nodes.
This presentation will overview a heuristic method for the p-MEC under the assumption that edge failures take place independently of each other.
Palabras clave: Discrete location, unreliable network
Programado
GT01 Localización IV. Discrete Location
8 de junio de 2022 16:00
A15
