M. Albareda Sambola, O. Lordan

A limited number of essential facilities need to be located in the nodes of a connected undirected graph G= (V, E) where each edge can become unavailable with a given probability. In some scenarios, after removing the edges that are not available, the graph can become disconnected. In such a scenario, a given node of the graph is considered to be covered if there is at least one facility located at its connected component. The goal of the maximum expected covering location problem in a graph with unreliable edges is to locate up to p facilities in the nodes of the graph, so that the expected number of covered nodes is maximized. We propose a new heuristic for this problem based on network flows, and compare it with the state-of-the art Tabu Search from the literature for different graph structures and under different assumptions on the distribution of the edge failures.

Keywords: Discrete Location, Unreliable network


GT1-2 Location
September 3, 2019  4:50 PM
I3L8. Georgina Blanes building

Other papers in the same session

A multi-objective metaheuristic for a reliability location problem

J. Alcaraz Soria, M. Landete Ruiz, J. F. Monge Ivars, J. L. Sainz-Pardo Auñón

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.