| Abstract: | To search for an optimum in a large search space, Wu, Mao, and Ma suggested the sequential elimination of levels (SELs)-method to find an optimal setting. Genetic algorithms (GAs) can be used to improve on this method. To make the search procedure more efficient, new ideas of forbidden array and weighted mutation are introduced. Relaxing the condition of orthogonality, GAs are able to accommodate a variety of design points, which allows more flexibility and enhances the likelihood of getting the best setting in fewer runs, particularly in the presence of interactions. The search procedure is enriched by a Bayesian method for identifying the important main effects and two-factor interactions. Illustration is given with the optimization of three functions, one of which is from Shekel's family. A real example on compound optimization is also given. |
