Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4959602 | European Journal of Operational Research | 2017 | 21 Pages |
Abstract
Set Covering Problems are one of the classical combinatorial optimization problems and part of many different practical applications, e. g., the location of emergency service facilities. In many real-world problems the required statistical parameters are not precisely known and the obtained solutions may reveal a non-adequate performance. We introduce a robust formulation of the uncertain/probabilistic Set Covering Problem which combines the concepts of robust and probabilistic optimization by introducing 'Î-robust α-covering' constraints. This Robust Uncertain Set Covering Problem can be stated as a compact mixed-integer linear programming model. Additionally, two non-compact integer linear model formulations are developed. As the strength of these formulations is not known a priori, we analyze the performance of these formulations in an extensive computational study. A case study for the location of emergency service facilities highlights the benefits of our approach in comparison to a formulation neglecting these uncertainties.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Pascal Lutter, Dirk Degel, Christina Büsing, Arie M.C.A. Koster, Brigitte Werners,