Abstract
A (v,k,t)-covering design is a collection of k-subsets (called blocks) of a v-set \({\mathcal{V}}\) such that every t-subset of \({\mathcal{V}}\) is contained in at least one block. Given v, k and t, the goal of the covering design problem is to find a covering made of a minimum number of blocks. In this paper, we present a new tabu algorithm for tackling this problem. Our algorithm exploits a new implementation designed in order to evaluate efficiently the performance of the neighbors of the current configuration. The new implementation is much less space-consuming than the currently used technique, making it possible to tackle much larger problem instances. It is also significantly faster. Thanks to these improved data structures, our tabu algorithm was able to improve the upper bound of more than 50 problem instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chan, A.H., Game, R.A.: (n,k,t)-Covering systems and error-trapping decoding. IEEE Trans. Inf. Theory 27, 643–646 (1981)
Colbourn, C.J., Dinitz, D.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. Chapman and Hall/CRC Press, Boca Raton (2007)
Crescenzi, P., Montecalvo, F., Rossi, G.: Optimal covering designs: complexity results and new bounds. Discrete Appl. Math. 144(3), 281–290 (2004)
Dai, C., Li, P.C., Toulouse, M.: A cooperative multilevel tabu search algorithm for the covering design problem. Artif. Evolution 119–130 (2005)
Etzion, T., Wei, V., Zhang, Z.: Bounds on the sizes of constant weight covering codes. Des. Codes Cryptogr. 5, 217–239 (1995)
Galinier, P., Hao, J.-K.: A general approach for constraint solving by local search. J. Math. Model. Algorithms 3(1), 73–88 (2004)
Fadlaoui, K., Galinier, P.: Covering designs constructed by using the TS-CD algorithm. Technical Report EPM-RT-2010-01, Ecole Polytechnique de Montréal (2010)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997)
Gordon, D.M., Kuperberg, G., Patashnik, O.: New constructions for covering designs. J. Combin. Des. 3, 269–284 (1995)
Gordon, D.M.: La Jolla covering repository tables. http://www.ccrwest.org/cover.html
Kreher, D.L., Stinson, D.R.: Combinatorial algorithms: generation, enumeration, and search. SIGACT News 30(1), 33–35 (1999)
Li, P.C., van Rees, G.H.J.: New constructions for lotto designs. Utilitas Math. 58, 45–64 (2000)
Margot, F.: Small covering designs by branch-and-cut. Math. Program. 94, 207–220 (2003)
Mills, W.H., Mullin, R.C.: Coverings and packings. In: Dinitz, J.H., Stinson, D.R. (eds.) Contemporary Design Theory, pp. 371–399 (1992)
Nurmela, K.J., Östergård, P.R.J.: Upper bounds for covering designs by simulated annealing. Congr. Numer. 96, 93–111 (1993)
Schönheim, J.: On coverings. Pac. J. Math. 14, 1405–1411 (1964)
Soriano, P., Gendreau, M.: Diversification strategies in tabu search algorithms for the maximum clique problem. Ann. Oper. Res. 63, 189–207 (1996)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by a grant from Natural Sciences and Engineering Research Council of Canada (NSERC).
Electronic Supplementary Material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Fadlaoui, K., Galinier, P. A tabu search algorithm for the covering design problem. J Heuristics 17, 659–674 (2011). https://doi.org/10.1007/s10732-010-9150-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-010-9150-2