M. Baldomero Naranjo, J. Kalcsics, A. M. Rodríguez-Chía

In this work, we focus our research on the upgrading version of the maximal covering location problem with edge length modifications.
Let G = (V, E) be an undirected network with node set V, edge set E, and non-negative node weights. For each edge, we are given its current length and an upper bound on the maximal reduction of its length. Moreover, we are given the cost per unit of reduction for each edge, which can be different for each edge, and a total budget for reductions. The upgrading maximal covering location problem with edge length modifications aims at reducing the length of the edges in such a way that the maximal coverage is maximized, subject to the given budget for reductions. In this work, we formulate the problem as a mixed-integer program and we develop some strategies for making the formulation solvable in a shorter time. The performance of the proposed resolution method will be tested on a set of networks.

Keywords: Covering problems, networks, upgrading problems


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.