Edge downgrades in the maximal covering location problem

We tackle the downgrading maximal covering location problem within a network. In this problem, two actors with conflicting objectives are involved: (a) The location planner aims to determine the location of facilities to maximize the covered demand while anticipating that an attacker will attempt to reduce coverage by increasing the length of some edges (downgrade); (b) The attacker seeks to maximize the demand initially covered by the facilities but left uncovered after the downgrade. The attacker can increase the length of certain edges within a specified budget. We introduce a mixed-integer linear bilevel program to formulate the problem, followed by a preprocessing phase and a matheuristic algorithm designed to address it. Additionally, computational results are presented to illustrate the potential and limitations of the proposed algorithm. • The downgrading maximal covering location problem in networks is addressed. • A location planner and attacker with conflicting objectives are involved. • The attacker modifies edge lengths within a budget to reduce coverage. • We propose a mixed-integer linear bilevel program for the problem. • A preprocessing phase and several variants of a matheuristic algorithm are designed.