Finding Balanced Incomplete Block Designs with Metaheuristics

This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulated as a combinatorial optimization problem (COP) whose solutions are binary matrices. Two different neighborhood structures are defined, based on bit-flipping and position-swapping. These are used within three metaheuristics, i.e., hill climbing, tabu search, and genetic algorithms. An extensive empirical evaluation is done using 86 different instances of the problem. The results indicate the superiority of the swap-based neighborhood, and the impressive performance of tabu search. This latter approach is capable of outperforming two techniques that had reported the best results in the literature (namely, a neural network with simulated annealing and a constraint local search algorithm).

[1]  R. Mead,et al.  The Design of Experiments: Statistical Principles for Practical Applications. , 1989 .

[2]  Toby Walsh,et al.  Constraint Patterns , 2003, CP.

[3]  Luis B. Morales,et al.  Constructing difference families through an optimization approach: Six new BIBDs , 2000 .

[4]  Patric R. J. Östergård,et al.  Computational Methods in Design Theory , 2006 .

[5]  J. Wishart.  Statistical tables , 2018, Global Education Monitoring Report.

[6]  Steven David Prestwich.  A Local Search Algorithm for Balanced Incomplete Block Designs , 2002, International Workshop on Constraint Solving and Constraint Logic Programming.

[7]  M. Buratti.  Some (17q, 17, 2) and (25q, 25, 3) BIBD Constructions , 1999 .

[8]  Carme Torras,et al.  Exploiting symmetries within constraint satisfaction search , 2001, Artif. Intell..

[9]  Ching-Shui Cheng.  Regular Graph Designs , 2006 .

[10]  R. Fisher.  An examination of the different possible solutions of a problem in incomplete blocks. , 1940 .

[11]  R. A. Fisher,et al.  Statistical Tables for Biological, Agricultural and Medical Research , 1956 .

[12]  Tue Tjur,et al.  An algorithm for optimization of block designs , 1993 .

[13]  Steven David Prestwich.  Negative Effects of Modeling Techniques on Search Performance , 2003, Ann. Oper. Res..

[14]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[15]  J. A. John,et al.  Construction of cyclic designs using integer programming , 1993 .

[16]  William G. Cochran,et al.  Experimental Designs, 2nd Edition , 1950 .

[17]  Cheng-Yan Kao,et al.  Optimal designs for microarray experiments , 2004, 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings..

[18]  T. Walsh,et al.  Matrix Modelling , 2001 .

[19]  Carme Torras,et al.  Comparison of simulated annealing and mean field annealing as applied to the generation of block designs , 2003, Neural Networks.

[20]  Jean-François Puget,et al.  Symmetry Breaking Revisited , 2002, Constraints.

[21]  Getachew Zergaw.  A SEQUENTIAL METHOD OF CONSTRUCTING OPTIMAL BLOCK DESIGNS , 1989 .

[22]  Ronald C. Mullin,et al.  PBDs and GDDs: The Basics , 2006 .

[23]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[24]  Carme Torras,et al.  MBMUDs: a combinatorial extension of BIBDs showing good optimality behaviour , 2004 .

[25]  Bahram Honary,et al.  New constructions of quasi-cyclic LDPC codes based on special classes of BIDBs for the AWGN and binary erasure channels , 2007, IEEE Trans. Commun..

[26]  Lefteris Angelis,et al.  An evolutionary algorithm for A-optimal incomplete block designs , 2003 .

[27]  J. A. John,et al.  Construction of block designs using mathematical programming , 1990 .

[28]  Derek G. Corneil,et al.  Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations , 1978 .

[29]  Klaus Hinkelmann,et al.  Partially Balanced Incomplete Block Designs , 2005 .