Software for Implementing the Sequential Elimination of Level Combinations Algorithm

Kjell Johnson, Abhyuday Mandal and Tan Ding

Journal of Statistical Software, 2008, vol. 025, issue i06

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.

Date: 2008-03-31
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.jstatsoft.org/index.php/jss/article/view/v025i06/v25i06.pdf
https://www.jstatsoft.org/index.php/jss/article/do ... ile/v025i06/SELC.sas
https://www.jstatsoft.org/index.php/jss/article/downloadSuppFile/v025i06/SELC.R
https://www.jstatsoft.org/index.php/jss/article/downloadSuppFile/v025i06/SELC.m
https://www.jstatsoft.org/index.php/jss/article/do ... 5i06/v25i06-data.zip

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:jss:jstsof:v:025:i06

DOI: 10.18637/jss.v025.i06

Access Statistics for this article

Journal of Statistical Software is currently edited by Bettina Grün, Edzer Pebesma and Achim Zeileis

More articles in Journal of Statistical Software from Foundation for Open Access Statistics
Bibliographic data for series maintained by Christopher F. Baum ().