Premium
An Annealing Algorithm for Searching Optimal Block Designs
Author(s) -
Jansen J.,
Douven R. C. M. H.,
van Berkum E. E. M.
Publication year - 1992
Publication title -
biometrical journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.108
H-Index - 63
eISSN - 1521-4036
pISSN - 0323-3847
DOI - 10.1002/bimj.4710340503
Subject(s) - simulated annealing , algorithm , block (permutation group theory) , computer science , mathematical optimization , mathematics , combinatorics
This paper is concerned with a computer algorithm for searching optimal block designs. The algorithm uses a technique called simulated annealing. Exchange and interchange steps are defined in a way similar to JONES and ECCLESTON (1980). Two examples are used to show the performance of the algorithm.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom