Software for Implementing the Sequential Elimination of Level Combinations Algorithm

Kjell Johnson, Abhyuday Mandal, Tan Ding

Main Article Content

Abstract

Genetic algorithms (GAs) are a popular technology to search for an optimum in a large search space. Using new concepts of forbidden array and weighted mutation, Mandal, Wu, and Johnson (2006) used elements of GAs to introduce a new global optimization technique called sequential elimination of level combinations (SELC), that efficiently finds optimums. A SAS macro, and MATLAB and R functions are developed to implement the SELC algorithm.

Article Details

Article Sidebar

Files:
Paper SAS source code for SELC R source code for SELC MATLAB source code for SELC Example data sets
Published:
Mar 31, 2008
DOI:
10.18637/jss.v025.i06