Published by the Foundation for Open Access Statistics Editors-in-chief: Bettina Grün, Torsten Hothorn, Edzer Pebesma, Achim Zeileis    ISSN 1548-7660; CODEN JSSOBK
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:: 3275. Submitted: 2007-08-23. Published: 2008-03-31.
Paper: Software for Implementing the Sequential Elimination of Level Combinations Algorithm     Download PDF (Downloads: 3229)
Supplements:
SELC.sas: SAS source code for SELC Download (Downloads: 1229; 15KB)
SELC.R: R source code for SELC Download (Downloads: 1336; 18KB)
SELC.m: MATLAB source code for SELC Download (Downloads: 1099; 19KB)
v25i06-data.zip: Example data sets Download (Downloads: 1083; 1KB)

DOI: 10.18637/jss.v025.i06

by
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.