An evolutionary algorithm for A-optimal incomplete block designs

Evolutionary algorithms are heuristic stochastic search and optimization techniques with principles taken from natural genetics. They are procedures mimicking the evolution process of an initial population through genetic transformations. This paper is concerned with the problem of finding A-optimal incomplete block designs for multiple treatment comparisons represented by a matrix of contrasts. An evolutionary algorithm for searching optimal, or nearly optimal, incomplete block designs is described in detail. Various examples regarding the application of the algorithm to some well-known problems illustrate the good performance of the algorithm

[1]  A. S. Hedayat,et al.  On the Theory of Connected Designs: Characterization and Optimality , 1974 .

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

[3]  Byron Jones,et al.  Exchange and Interchange Procedures to Search for Optimal Designs , 1980 .

[4]  S. C. Pearce,et al.  The Agricultural Field Experiment. , 1985 .

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

[6]  Lefteris Angelis,et al.  Construction of A-efficient block designs for comparing test treatments with a control through (M, S)-optimality , 1994 .

[7]  S. Chatterjee,et al.  Genetic algorithms and their statistical applications: an introduction , 1996 .

[8]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[9]  Lefteris Angelis,et al.  Optimal Exact Experimental Designs with Correlated Errors Through a Simulated Annealing Algorithm , 2001 .

[10]  A. Hedayat,et al.  Optimal Incomplete Block Designs for Comparing Treatments with a Control , 1983 .

[11]  Toby J. Mitchell,et al.  An Algorithm for the Construction of “D-Optimal” Experimental Designs , 2000, Technometrics.

[12]  David B. Fogel,et al.  Evolutionary algorithms in theory and practice , 1997, Complex.

[13]  Olivier C. Martin,et al.  Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..

[14]  Byron Jones,et al.  An Algorithm for Deriving Optimal Block Designs , 1976 .

[15]  Dibyen Majumdar,et al.  Optimal designs for comparisons between two sets of treatments , 1986 .

[16]  R. J. Martin,et al.  An algorithm for the design of factorial experiments when the data are correlated , 1999, Stat. Comput..

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

[18]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[19]  J. Jansen,et al.  An Annealing Algorithm for Searching Optimal Block Designs , 1992 .

[20]  Wolfgang Banzhaf,et al.  Genetic Programming: An Introduction , 1997 .

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