Robust min-max regret covering problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computational Optimization and Applications Année : 2022

Robust min-max regret covering problems

Résumé

This article deals with two min-max regret covering problems: the min-max regret Weighted Set Covering Problem (min-max regret WSCP) and the min-max regret Maximum Benefit Set Covering Problem (min-max regret MSCP). These problems are the robust optimization counterparts, respectively, of the Weighted Set Covering Problem and of the Maximum Benefit Set Covering Problem. In both problems, uncertainty in data is modeled by using an interval of continuous values, representing all the infinite values every uncertain parameter can assume. This study has the following major contributions: (i) a proof that MSCP is Σ2p-Hard, (ii) a mathematical formulation for the min-max regret MSCP, (iii) exact and (iv) heuristic algorithms for the min-max regret WSCP and the min-max regret MSCP. We reproduce the main exact algorithms for the min-max regret WSCP found in the literature: a Logic-based Benders decomposition, an extended Benders decomposition and a branch-and-cut. In addition, such algorithms have been adapted for the min-max regret MSCP. Moreover, five heuristics are applied for both problems: two scenario-based heuristics, a path relinking, a pilot method and a linear programming-based heuristic. The goal is to analyze the impact of such methods on handling robust covering problems in terms of solution quality and performance.

Dates et versions

hal-03713937 , version 1 (05-07-2022)

Identifiants

Citer

Andréa Cynthia Santos, Amadeu Almeida Coco, Thiago Ferreira de Noronha. Robust min-max regret covering problems. Computational Optimization and Applications, 2022, 83 (1), pp.111-141. ⟨10.1007/s10589-022-00391-x⟩. ⟨hal-03713937⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More