Exchange algorithms for constructing large spatial designs

Exchange algorithms are widely used for optimizing design criteria and have proven to be highly effective. However, application of these algorithms can be computationally prohibitive for very large design problems, and in situations for which the design criterion is sufficiently complex so as to prevent efficient evaluation strategies. This paper reports on several modifications to exchange algorithms that lead to large reductions in the computational burden associated with optimizing any given design criterion. A small study indicates that these modifications do not significantly impact the quality of designs, while reductions in effort of over 90% can be achieved.