Marta Baldomero-Naranjo , Jörg Kalcsics , Antonio M. Rodríguez-Chía
{"title":"Edge downgrades in the maximal covering location problem","authors":"Marta Baldomero-Naranjo , Jörg Kalcsics , Antonio M. Rodríguez-Chía","doi":"10.1016/j.cor.2025.107003","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div><div>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.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"178 ","pages":"Article 107003"},"PeriodicalIF":4.1000,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825000310","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
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.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.