Optimizing Two-Level Supersaturated Designs Using Swarm Intelligence Techniques

Abstract

Supersaturated designs (SSDs) are often used to reduce the number of experimental runs in screening experiments with a large number of factors. As more factors are used in the study, the search for an optimal SSD becomes increasingly challenging because of the large number of feasible selection of factor level settings. This paper tackles this discrete optimization problem via an algorithm based on swarm intelligence. Using the commonly used E(s2) criterion as an illustrative example, we propose an algorithm to find E(s2)–optimal SSDs by showing that they attain the theoretical lower bounds in Bulutoglu and Cheng (2004) and Bulutoglu (2007). We show that our algorithm consistently produces SSDs that are at least as efficient as those from the traditional CP exchange method in terms of computational effort, frequency of finding the E(s2)-optimal SSD and also has good potential for finding D3–, D4– and D5–optimal SSDs.

Runtime Estimation and Scheduling on Parallel Processing Supercomputers via Instance-Based Learning and Swarm Intelligence

“…Phoa et al [18] introduced the Swarm Intelligence Based (SIB) method with two new operations, MIX and MOVE, to tackle optimization problems in discrete spaces, which are common in mathematical and statistical optimization. This method is then widely used in many applications, see [19]- [22]. The general idea of the SIB algorithm in depicted…”

Extended two-stage adaptive designs with three target responses for phase II clinical trials

“…The latter designs have non-differentiable optimality criteria that require a couple of nested levels of optimization and are notoriously difficult to find. Phoa et al (2016) applied swarm intelligence to find an optimal supersaturated design in a high dimension problem that involves judicious and repeated exchanges of columns in the design matrix to minimize correlations among the columns via the E ( s 2 ) criterion. PSO has also successfully used for estimation in statistical problems.…”

A Two-Step Approach to the Search of Minimum Energy Designs via Swarm Intelligence

“…[ 7 ] proposed a new nature-inspired metaheuristic optimization method called the Swarm Intelligence Based (SIB) method. This algorithm works well in a wide range of discrete optimization problems, such as searching for circulant partial Hadamard matrices with maximum number of columns [ 8 ], E( )-optimal supersaturated designs [ 9 ], and optimal designs of computer experiments under multiple objectives [ 10 ]. In addition, SIB also performed well in optimization problems for continuous domains, like efficient construction of confidence sets and the confidence bands for target localization [ 11 ].…”