An iterated local search algorithm for the construction of large scale D-optimal experimental designs
Download full text from publisher
References listed on IDEAS
- Lejeune, Miguel A., 2003. "Heuristic optimization of experimental designs," European Journal of Operational Research, Elsevier, vol. 147(3), pages 484-498, June.
- Grace Montepiedra, 1998. "Application of genetic algorithms to the construction of exact D-optimal designs," Journal of Applied Statistics, Taylor & Francis Journals, vol. 25(6), pages 817-826.
- Arnouts, Heidi & Goos, Peter, 2010. "Update formulas for split-plot and block designs," Computational Statistics & Data Analysis, Elsevier, vol. 54(12), pages 3381-3391, December.
- Nguyen, Nam-Ky & Miller, Alan J., 1992. "A review of some exchange algorithms for constructing discrete D-optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 14(4), pages 489-498, November.
- Sung Jung, Joo & Jin Yum, Bong, 1996. "Construction of exact D-optimal designs by tabu search," Computational Statistics & Data Analysis, Elsevier, vol. 21(2), pages 181-191, February.
More about this item
KeywordsOptimal design of experiments; D-optimality criterion; Metaheuristic; Iterated local search; Coordinate-exchange algorithm;
NEP fieldsThis paper has been announced in the following NEP Reports:
- NEP-ALL-2013-05-05 (All new papers)
- NEP-CMP-2013-05-05 (Computational Economics)
- NEP-EXP-2013-05-05 (Experimental Economics)
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2013006. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys). General contact details of provider: http://edirc.repec.org/data/ftufsbe.html .
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.