Abstract
We study the Set Covering Problem with uncertain costs. For each cost coefficient, only an interval estimate is known, and it is assumed that each coefficient can take on any value from the corresponding uncertainty interval, regardless of the values taken by other coefficients. It is required to find a robust deviation (also called minmax regret) solution. For this strongly NP-hard problem, we present and compare computationally three exact algorithms, where two of them are based on Benders decomposition and one uses Benders cuts in the context of a Branch-and-Cut approach, and several heuristic methods, including a scenario-based heuristic, a Genetic Algorithm, and a Hybrid Algorithm that uses a version of Benders decomposition within a Genetic Algorithm framework.
Similar content being viewed by others
References
Aggarwal, C., Orlin, J., & Tai, R. (1997). Optimized crossover for the independent set problem. Operations Research, 45, 226–234.
Aissi, H., Bazgan, C., & Vanderpooten, D. (2009). Min-max and min-max regret versions of combinatorial optimization problems: a survey. European Journal of Operational Research, 197(2), 427–438.
Averbakh, I. (2001). On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming, 90, 263–272.
Averbakh, I., & Lebedev, V. (2004). Interval data minmax regret network optimization problems. Discrete Applied Mathematics, 138, 289–301.
Bautista, J., & Pereira, J. (2006). Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona. Omega, 34, 617–629.
Beasley, J. E. (1990). OR-Library: distributing test problems by electronic mail. The Journal of the Operational Research Society, 41, 1069–1072.
Beasley, J. E., & Chu, P. C. (1996). A genetic algorithm for the set covering problem. European Journal of Operational Research, 94, 392–404.
Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238–252.
Brusco, M. J., Jacobs, L. W., & Thompson, G. M. (1999). A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated weighted set-covering problems. Annals of Operation Research, 86, 611–627.
Caprara, A., Toth, P., & Fischetti, M. (2000). Algorithms for the set covering problem. Annals of Operation Research, 98, 353–371.
Ceria, S., Nobili, P., & Sassano, A. (1997). Set covering problem. In M. Dell‘Amico, F. Maffioli, & S. Martello (Eds.), Annotated bibliographies in combinatorial optimization (pp. 415–428). New York: Wiley.
Cochran, J. K., & Marquez Uribe, A. (2005). A set covering formulation for agile capacity planning within supply chains. International Journal of Production Economics, 95, 139–149.
Ernst, A. T., Jiang, H., Krishnamoorthy, M., & Sier, D. (2004). Staff scheduling and rostering: a review of applications, methods and models. European Journal of Operational Research, 153, 3–27.
Fischetti, M., Salvagnin, D., & Zanette, A. (2010). A note on the selection of Benders’ cuts. Mathematical Programming, 124, 175–182.
Gambardella, L. M., Taillard, A. D., & Agazzi, G. (1999). MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp. 63–76). New York: McGraw-Hill.
Geoffrion, A. M. (1972). Generalized Benders decomposition. Journal of Optimization Theory and Applications, 10, 237–260.
Gothe-Lundgren, M., & Larsson, T. (1994). A set covering reformulation of the pure fixed charge transportation problem. Discrete Applied Mathematics, 48, 245–259.
Jaszkiewicz, A. (2004). A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm. Annals of Operation Research, 131, 135–158.
Jourdan, L., Basseur, M., & Talbi, E. G. (2009). Hybridizing exact methods and metaheuristics: a taxonomy. European Journal of Operational Research, 199, 620–629.
Kasperski, A. (2008). Discrete optimization with interval data: minmax regret and fuzzy approach. Studies in fuzziness and soft computing. Berlin: Springer.
Kasperski, A., & Zielinski, P. (2004). Minimizing maximal regret in linear assignment problems with interval data (Raport serii PREPRINTY nr. 007). Instytut Matematyki PWr., Wroclaw.
Kasperski, A., & Zielinski, P. (2005). An approximation algorithm for interval data minmax regret combinatorial optimization problems. Information Processing Letters, 97, 177–180.
Kouvelis, P., & Yu, G. (2003). Robust discrete optimization and its applications. Dordrecht: Kluwer.
Lan, G., Dupuy, G. W., & Whitehouse, G. E. (2007). An effective and simple heuristic for the set covering problem. European Journal of Operational Research, 176, 1387–1403.
Montemanni, R. (2006). A Benders decomposition approach for the robust spanning tree problem with interval data. European Journal of Operational Research, 174(3), 1479–1490.
Montemanni, R., & Gambardella, L. M. (2005). The robust shortest path problem with interval data via Benders decomposition. 4OR, 3, 315–328.
Montemanni, R., Barta, J., Mastrolilli, M., & Gambardella, L. M. (2007). The robust Traveling Salesman Problem with interval data. Transportation Science, 41, 366–381.
Moscato, P., & Cotta, C. (2002). A gentle introduction to Memetic Algorithms. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 105–144). Dordrecht: Kluwer.
Pereira, J., & Averbakh, I. (2009). Exact and heuristic algorithms for the interval data robust assignment problem. Working paper, University of Toronto.
Ren, Z., Feng, Z., Ke, L., & Zhang, Z. (2010). New ideas for applying ant colony optimization to the set covering problem. Computers and Industrial Engineering, 58, 774–784.
Revelle, C., Marks, D., & Liebman, J. S. (1970). An analysis of private and public sector location models. Management Science, 16, 692–707.
Talbi, E.-G. (2002). A taxonomy of hybrid metaheuristics. Journal of Heuristics, 8, 541–564.
Umetani, S., & Yagiura, M. (2007). Relaxation heuristics for the set covering problem. Journal of the Operations Research Society of Japan, 50, 350–375.
Yagiura, M., & Ibaraki, T. (1996). The use of dynamic programming in genetic algorithms for permutation problems. European Journal of Operational Research, 92, 387–401.
Yagiura, M., Kishida, M., & Ibaraki, T. (2006). A 3-flip neighborhood local search for the set covering problem. European Journal of Operational Research, 172, 472–499.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pereira, J., Averbakh, I. The Robust Set Covering Problem with interval data. Ann Oper Res 207, 217–235 (2013). https://doi.org/10.1007/s10479-011-0876-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-0876-5