Authors: | Kjell Johnson, Abhyuday Mandal, Tan Ding | ||||||||
Title: | Software for Implementing the Sequential Elimination of Level Combinations Algorithm | ||||||||
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. | ||||||||
Page views:: 4543. Submitted: 2007-08-23. Published: 2008-03-31. |
|||||||||
Paper: |
Software for Implementing the Sequential Elimination of Level Combinations Algorithm
Download PDF
(Downloads: 3399)
|
||||||||
Supplements: |
| ||||||||
DOI: |
10.18637/jss.v025.i06
|
![]() This work is licensed under the licenses Paper: Creative Commons Attribution 3.0 Unported License Code: GNU General Public License (at least one of version 2 or version 3) or a GPL-compatible license. |