Abstract
This paper introduces the multi-mode set covering problem, which consists of a plurality of set covering problems linked by cardinality constraints. We propose a variable neighborhood search algorithm and a greedy randomized adaptive search procedure based on a common local search routine. This routine applies a penalized relaxation of the covering constraints, tuned by self-adapting parameters, and visits a sequence of neighborhoods in a nested strategy. We compare the two heuristics with each other and with a time-limited run of a general-purpose integer linear programming solver, on a benchmark set of instances with heterogeneous structure. Both heuristics outperform the solver, though with interesting differences with respect to the various classes of instances. In particular, the variable neighborhood search algorithm proves more effective and less dependent on the specific features of the instances.
Similar content being viewed by others
Notes
The density or coverage degree of a subset is the number (%) of elements of the ground set included in the subset, i.e., the number (%) of rows covered by the column.
References
Aickelin, U., Dowsland, K.A.: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. J. Sched. 3(3), 139–153 (2000)
Ashouri, M., Zali, Z., Mousavi, S.R., Hashemi, M.R.: New optimal solution to disjoint set K-coverage for lifetime extension in wireless sensor networks. IET Wirel. Sens. Syst. 2(1), 31–39 (2012)
Beasley, J.E.: An algorithm for set covering problems. Eur. J. Oper. Res. 31, 85–93 (1987)
Berman, P., DasGupta, B., Sontag, E.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene network. Discret. Appl. Math. 155(6–7), 733–749 (2007)
Bicakci, K., Bagci, I.E., Tavli, B., Pala, Z.: Neighbor sensor networks: increasing lifetime and eliminating partitioning through cooperation. Comput. Stand. Interfaces 35(4), 396–402 (2013)
Chen, T., Filkov, V., Skiena, S.S.: Identifying gene regulatory networks from experimental data. Parallel Comput. 27, 141–162 (2001)
Chvátal, V.: A greedy heuristic for the set covering problem. Math. Oper. Res. 4, 233–235 (1979)
Cordone, R., Lulli, G.: An integer optimization approach for reverse engineering of gene regulatory networks. Discret. Appl. Math. 61(4–5), 580–592 (2013)
Cordone, R., Lulli, G.: A GRASP metaheuristic for microarray data analysis. Comput. Oper. Res. (in press), (2012). doi: 10.1016/j.cor.2012.10.008
Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
Gent, I.P., Walsh, T.: Towards an understanding of hill-climbing procedures for SAT. In: Proceedings of the 11th National Conference on, Artificial Intelligence (AAAI’93), pp. 28–33 (1993)
Hansen, P., Mladenoviç, N., Moreno Pérez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367–407 (2010)
Hua, Q.-S., Yu, D., Lau, F.C.M., Wang, Y.: Exact algorithms for set multicover and multiset multicover problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (Eds.) Proceedings of ISAAC Conference 2009, LNCS, vol. 5878, pp. 34–44 (2009)
Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256–278 (1974)
Lan, G., DePuy, G.W., Whitehouse, G.E.: An effective and simple heuristic for the set covering problem. Eur. J. Oper. Res. 176, 1387–1403 (2007)
Lulli, G., Romauch, M.: A mathematical program to refine gene regulatory networks. Discret. Appl. Math. 157, 2469–2482 (2009)
Prais, M., Ribeiro, C.C.: Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12, 164–176 (2000)
Srinivasan, A.: An extension of the Lovász local lemma, and its applications to integer programming. SIAM J. Comput. 36, 609–634 (2006)
Villa, T., Kam, T., Brayton, R.K., Sangiovanni-Vincentelli, A.L.: Explicit and implicit algorithms for binate covering problems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(7), 677–691 (1997)
Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics 1, 80–83 (1945)
Yagiura, M., Kishida, M., Ibaraki, T.: A 3-flip neighborhood local search for the set covering problem. Eur. J. Oper. Res. 172(2), 472–499 (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Colombo, F., Cordone, R. & Lulli, G. A variable neighborhood search algorithm for the multimode set covering problem. J Glob Optim 63, 461–480 (2015). https://doi.org/10.1007/s10898-013-0094-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-013-0094-6