Current Volume | Browse | Search | RSSHome | Instructions for Authors | LaTeX Style Files | Editorial Board

Authors: Kjell Johnson, Abhyuday Mandal, Tan Ding
Title: [download]
(544)
Software for Implementing the Sequential Elimination of Level Combinations Algorithm
Reference: Vol. 25, Issue 6, Mar 2008
Submitted 2007-08-23, Accepted 2008-02-24
Type: Article
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.

Paper: [download]
(544)
Software for Implementing the Sequential Elimination of Level Combinations Algorithm
(application/pdf, 258.5 KB)
Supplements: [download]
(290)
SELC.sas: SAS source code for SELC
(application/octet-stream, 15.7 KB)
[download]
(283)
SELC.R: R source code for SELC
(text/plain, 18.5 KB)
[download]
(242)
SELC.m: MATLAB source code for SELC
(application/octet-stream, 19.6 KB)
[download]
(267)
v25i06-data.zip: Example data sets
(application/zip, 1.1 KB)
Resources: BibTeX | OAI
Creative Commons License
This work is licensed under the licenses
Paper: Creative Commons Attribution 3.0 Unported License
Code: Commons GNU General Public License License
Current Volume | Browse | Search | RSSHome | Instructions for Authors | LaTeX Style Files | Editorial Board