Abstract
This work describes an adaptation of multilevel search to the covering design problem. The search engine is a tabu search algorithm which explores several levels of overlapping search spaces of a t–(v,k,λ) covering design problem. Tabu search finds “good” approximations of covering designs in each search space. Blocks from those approximate solutions are transferred to other levels, redefining the corresponding search spaces. The dynamics of cooperation among levels tends to regroup good approximate solutions into small search spaces. Tabu search has been quite effective at finding re-combinations of blocks in small search spaces which provide successful search directions in larger search spaces.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barnard, S.T., Simon, H.D.: A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems. Concurrency: Partice & Experience 6(2), 111–117 (1994)
J.A.: Bate. A Generalized Covering Problem. PhD thesis, University of Manitoba (1978)
Brandt, A.: Multi-level adaptive solutions to boundary value problems. Mathematics of Computation 31, 333–390 (1977)
Briggs, W.L., Henson, V.E., McCormick, S.F.: A Multigrid Tutorial. SIAM, Philadelphia (1999)
Colbourn, C.J., Dinitz, J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (1996)
Crainic, T.G., Li, Y., Toulouse, M.: A Simple Cooperative Multilevel Algorithm for the Capacitated Multicommodity Network Design. Computer & Operations Research (accepted for publication)
Erdős, P., Hanani, H.: On a limit theorem in combinatorial analysis. Publicationes Mathematicae Debrecen 10, 10–13 (1963)
Gordon, C.J.: Web site of covering bounds, http://www.ccrwest.org/cover.html
Gordon, C.J., Patashnik, O., Kuperberg, G.: New constructions for covering designs. Journal of Combinatorial Designs 3(4), 269–284 (1995)
Hendrickson, B., Leland, R.: The Chaco User’s Guide: Version 2.0. Report SAND95-2344, Sandia National Laboratories (1995)
Margot, F.: Small covering designs by branch-and-cut. Mathematical Programming 94, 207–220 (2003)
Mills, W.H., Mullin, R.C.: Coverings and packings. In: Contemporary Design Theory: A Collection of Surveys. Wiley-Interscience Series in Discrete Mathematics and Optimization, pp. 371–399 (1992)
Mills, W.H.: Covering designs I: coverings by a small number of subsets. Ars Combinatoria 8, 199–315 (1979)
Nurmela, K.J.: Constructing combinatorial designs by local search. Technical report, Helsinki University of Technology (November 1993)
Nurmela, K.J., Östergård, P.R.J.: Constructing covering designs by simulated annealing. Technical report, Helsinki University of Technology (January 1993)
Nurmela, K.J., Östergård, P.R.J.: New coverings of t-sets with (t+1)-sets. Journal of Combinatorial Designs 7, 217–226 (1999)
Ouyang, M., Toulouse, M., Thulasiraman, K., Glover, F., Deogun, J.S.: Multilevel Cooperative Search for the Circuit/Hypergraph Partitioning Problem. IEEE Transactions on Computer-Aided Design 21(6), 685–693 (2002)
Rödl, V.: On a packing and covering problem. European Journal of Combinatorics 5, 69–78 (1985)
Schönheim, J.: On coverings. Pacific Journal of Mathematics 14, 1405–1411 (1964)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dai, C., Li, (.P.C., Toulouse, M. (2006). A Cooperative Multilevel Tabu Search Algorithm for the Covering Design Problem. In: Talbi, EG., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2005. Lecture Notes in Computer Science, vol 3871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11740698_11
Download citation
DOI: https://doi.org/10.1007/11740698_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33589-4
Online ISBN: 978-3-540-33590-0
eBook Packages: Computer ScienceComputer Science (R0)