Robust Combinatorial Optimization with Locally Budgeted Uncertainty
Open Journal of Mathematical Optimization, Tome 2 (2021), article no. 3, 18 p.

Budgeted uncertainty sets have been established as a major influence on uncertainty modeling for robust optimization problems. A drawback of such sets is that the budget constraint only restricts the global amount of cost increase that can be distributed by an adversary. Local restrictions, while being important for many applications, cannot be modeled this way.

We introduce a new variant of budgeted uncertainty sets, called locally budgeted uncertainty. In this setting, the uncertain parameters are partitioned, such that a classic budgeted uncertainty set applies to each part of the partition, called region.

In a theoretical analysis, we show that the robust counterpart of such problems for a constant number of regions remains solvable in polynomial time, if the underlying nominal problem can be solved in polynomial time as well. If the number of regions is unbounded, we show that the robust selection problem remains solvable in polynomial time, while also providing hardness results for other combinatorial problems.

In computational experiments using both random and real-world data, we show that using locally budgeted uncertainty sets can have considerable advantages over classic budgeted uncertainty sets.

Reçu le :
Révisé le :
Accepté le :
Publié le :
DOI : 10.5802/ojmo.5
Mots-clés : robust optimization, combinatorial optimization, budgeted uncertainty
Goerigk, Marc 1 ; Lendl, Stefan 2, 3

1 Network and Data Science Management, University of Siegen, Siegen, Germany
2 Institute of Discrete Mathematics, Graz University of Technology, Graz, Austria
3 Department of Operations and Information Systems, University of Graz, Austria
@article{OJMO_2021__2__A3_0,
     author = {Goerigk, Marc and Lendl, Stefan},
     title = {Robust {Combinatorial} {Optimization} with {Locally} {Budgeted} {Uncertainty}},
     journal = {Open Journal of Mathematical Optimization},
     eid = {3},
     pages = {1--18},
     publisher = {Universit\'e de Montpellier},
     volume = {2},
     year = {2021},
     doi = {10.5802/ojmo.5},
     language = {en},
     url = {http://www.numdam.org/articles/10.5802/ojmo.5/}
}
TY  - JOUR
AU  - Goerigk, Marc
AU  - Lendl, Stefan
TI  - Robust Combinatorial Optimization with Locally Budgeted Uncertainty
JO  - Open Journal of Mathematical Optimization
PY  - 2021
SP  - 1
EP  - 18
VL  - 2
PB  - Université de Montpellier
UR  - http://www.numdam.org/articles/10.5802/ojmo.5/
DO  - 10.5802/ojmo.5
LA  - en
ID  - OJMO_2021__2__A3_0
ER  - 
%0 Journal Article
%A Goerigk, Marc
%A Lendl, Stefan
%T Robust Combinatorial Optimization with Locally Budgeted Uncertainty
%J Open Journal of Mathematical Optimization
%D 2021
%P 1-18
%V 2
%I Université de Montpellier
%U http://www.numdam.org/articles/10.5802/ojmo.5/
%R 10.5802/ojmo.5
%G en
%F OJMO_2021__2__A3_0
Goerigk, Marc; Lendl, Stefan. Robust Combinatorial Optimization with Locally Budgeted Uncertainty. Open Journal of Mathematical Optimization, Tome 2 (2021), article  no. 3, 18 p. doi : 10.5802/ojmo.5. http://www.numdam.org/articles/10.5802/ojmo.5/

[1] Aissi, Hassene; Bazgan, Cristina; Vanderpooten, Daniel Min–max and min–max regret versions of combinatorial optimization problems: A survey, Eur. J. Oper. Res., Volume 197 (2009) no. 2, pp. 427-438 | DOI | MR | Zbl

[2] Alimonti, Paola; Kann, Viggo Some APX-completeness results for cubic graphs, Theor. Comput. Sci., Volume 237 (2000) no. 1-2, pp. 123-134 | DOI | MR | Zbl

[3] Alves Pessoa, Artur; Di Puglia Pugliese, Luigi; Guerriero, Francesca; Poss, Michael Robust constrained shortest path problems under budgeted uncertainty, Networks, Volume 66 (2015) no. 2, pp. 98-111 | DOI | MR | Zbl

[4] Bertsimas, Dimitris; Gupta, Vishal; Kallus, Nathan Data-driven robust optimization, Math. Program., Volume 167 (2018) no. 2, pp. 235-292 | DOI | MR | Zbl

[5] Bertsimas, Dimitris; Sim, Melvyn Robust discrete optimization and network flows, Math. Program., Volume 98 (2003) no. 1, pp. 49-71 | DOI | MR | Zbl

[6] Bertsimas, Dimitris; Sim, Melvyn The price of robustness, Oper. Res., Volume 52 (2004) no. 1, pp. 35-53 | DOI | MR | Zbl

[7] Bougeret, Marin; Pessoa, Artur Alves; Poss, Michael Robust scheduling with budgeted uncertainty, Discrete Appl. Math., Volume 261 (2019), pp. 93-107 | DOI | MR | Zbl

[8] Büsing, Christina; D’andreagiovanni, Fabio New results about multi-band uncertainty in robust optimization, International Symposium on Experimental Algorithms, Springer (2012), pp. 63-74 | DOI

[9] Chassein, André; Dokka, Trivikram; Goerigk, Marc Algorithms and uncertainty sets for data-driven robust shortest path problems, Eur. J. Oper. Res., Volume 274 (2019) no. 2, pp. 671-686 | DOI | MR | Zbl

[10] Chassein, André; Goerigk, Marc; Kasperski, Adam; Zieliński, Paweł On recoverable and two-stage robust selection problems with budgeted uncertainty, Eur. J. Oper. Res., Volume 265 (2018) no. 2, pp. 423-436 | DOI | MR | Zbl

[11] Chassein, André; Goerigk, Marc; Kurtz, Jannis; Poss, Michael Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty, Eur. J. Oper. Res., Volume 279 (2019) no. 2, pp. 308-319 | DOI | MR | Zbl

[12] Deineko, Vladimir G.; Woeginger, Gerhard J. Complexity and in-approximability of a selection problem in robust optimization, 4OR, Volume 11 (2013) no. 3, pp. 249-252 | DOI | MR | Zbl

[13] Erlebach, Thomas; Kellerer, Hans; Pferschy, Ulrich Approximating multiobjective knapsack problems, Manage. Sci., Volume 48 (2002) no. 12, pp. 1603-1612 | DOI | Zbl

[14] Garey, Michael R.; Johnson, David S. Computers and intractability, A Series of Books in the mathematical Sciences, 174, W. H. Freeman and Company, 1979 | Zbl

[15] Gens, Georgii V.; Levner, Eugenii V. Computational complexity of approximation algorithms for combinatorial problems, International Symposium on Mathematical Foundations of Computer Science, Springer (1979), pp. 292-300 | Zbl

[16] Goerigk, Marc; Lendl, Stefan; Wulf, Lasse Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty (2020) (https://arxiv.org/abs/2008.12727)

[17] Gounaris, Chrysanthos E.; Repoussis, Panagiotis P.; Tarantilis, Christos D.; Wiesemann, Wolfram; Floudas, Christodoulos A. An adaptive memory programming framework for the robust capacitated vehicle routing problem, Transportation Science, Volume 50 (2016) no. 4, pp. 1239-1260 | DOI

[18] Hansknecht, Christoph; Richter, Alexander; Stiller, Sebastian Fast robust shortest path computations, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)

[19] Kasperski, Adam; Zieliński, Paweł Robust discrete optimization under discrete and interval uncertainty: A survey, Robustness analysis in decision aiding, optimization, and analytics, Springer, 2016, pp. 113-143 | DOI

[20] Kellerer, Hans; Pferschy, Ulrich; Pisinger, David Knapsack Problems, Springer, 2004 | Zbl

[21] Kouvelis, Panos; Yu, Gang Robust discrete optimization and its applications, 14, Springer, 2013 | Zbl

[22] Poss, Michael Robust combinatorial optimization with variable budgeted uncertainty, 4OR, Volume 11 (2013) no. 1, pp. 75-92 | DOI | MR | Zbl

[23] Poss, Michael Robust combinatorial optimization with knapsack uncertainty, Discrete Optimization, Volume 27 (2018), pp. 88-102 | DOI | MR | Zbl

[24] Saket, Rishi; Sviridenko, Maxim New and improved bounds for the minimum set cover problem, Approximation, randomization, and combinatorial optimization. Algorithms and techniques, Springer, 2012, pp. 288-300 | DOI | Zbl

[25] Woeginger, Gerhard J. Exact algorithms for NP-hard problems: A survey, Combinatorial optimization – Eureka, you shrink! (Lecture Notes in Computer Science), Volume 2570, Springer, 2003, pp. 185-207 | DOI | MR | Zbl

Cité par Sources :