Paper Info
Title
Constructing uniform designs: A heuristic integer programming method
Abstract
In this paper, the wrap-around L"2-discrepancy (WD) of asymmetrical design is represented as a quadratic form, thus the problem of constructing a uniform design becomes a quadratic integer programming problem. By the theory of optimization, some theoretic properties are obtained. Algorithms for constructing uniform designs are then studied. When the number of runs n is smaller than the number of all level-combinations m, the construction problem can be transferred to a zero-one quadratic integer programming problem, and an efficient algorithm based on the simulated annealing is proposed. When n=m, another algorithm is proposed. Empirical study shows that when n is large, the proposed algorithms can generate designs with lower WD compared to many existing methods. Moreover, these algorithms are suitable for constructing both symmetrical and asymmetrical designs.
Year
DOI
Venue
2012
10.1016/j.jco.2011.10.005
J. Complexity
Keywords
DocType
Volume
uniform design,construction problem,asymmetrical design,zero-one quadratic integer programming,lower WD,runs n,quadratic form,heuristic integer programming method,efficient algorithm,proposed algorithm,quadratic integer programming problem
Journal
28
Issue
ISSN
Citations 
2
0885-064X
2
PageRank 
References 
Authors
0.49
8
3
Name
Order
Citations
PageRank
Yong-Dao Zhou172.40
Kai-Tai Fang216523.65
Jianhui Ning3102.18