Compromise solutions for robust combinatorial optimization with variable-sized uncertainty

André Chassein and Marc Goerigk

European Journal of Operational Research, 2018, vol. 269, issue 2, 544-555

Abstract: In classic robust optimization, it is assumed that a set of possible parameter realizations, the uncertainty set, is modeled in a previous step and part of the input. As recent work has shown, finding the most suitable uncertainty set is in itself already a difficult task. We consider robust problems where the uncertainty set is not completely defined. Only the shape is known, but not its size. Such a setting is known as variable-sized uncertainty.In this paper, we present an approach how to find a single robust solution, that performs well on average over all possible uncertainty set sizes. We demonstrate that this approach can be solved efficiently for min–max robust optimization, but is more involved in the case of min–max regret, where positive and negative complexity results for the selection problem, the minimum spanning tree problem, and the shortest path problem are provided. We introduce an iterative solution procedure, and evaluate its performance in an experimental comparison.

Keywords: Robustness and sensitivity analysis; Robust combinatorial optimization; Min–max regret; Variable-sized uncertainty (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221718300924
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:269:y:2018:i:2:p:544-555

DOI: 10.1016/j.ejor.2018.01.056

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().