A hybrid SAGA algorithm for the construction of E (s2)-optimal cyclic supersaturated designs

Koukouvinos, C; Mylona, K; Simos, DE

dc.contributor.author	Koukouvinos, C	en
dc.contributor.author	Mylona, K	en
dc.contributor.author	Simos, DE	en
dc.date.accessioned	2014-03-01T01:29:33Z
dc.date.available	2014-03-01T01:29:33Z
dc.date.issued	2009	en
dc.identifier.issn	0378-3758	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/19306
dc.subject	Cyclic generator	en
dc.subject	E (s2)-optimality	en
dc.subject	Factorial designs	en
dc.subject	Genetic algorithms	en
dc.subject	Hybrid	en
dc.subject	Metaheuristics	en
dc.subject	Simulated annealing	en
dc.subject	Supersaturated designs	en
dc.subject.classification	Statistics & Probability	en
dc.subject.other	GENETIC ALGORITHMS	en
dc.subject.other	OPTIMIZATION	en
dc.title	A hybrid SAGA algorithm for the construction of E (s2)-optimal cyclic supersaturated designs	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.jspi.2008.05.006	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.jspi.2008.05.006	en
heal.language	English	en
heal.publicationDate	2009	en
heal.abstract	In this paper, we propose a hybrid simulated annealing genetic algorithm (SAGA) for generating cyclic structured supersaturated designs. The hybrid SAGA combines features such as the power of the GA and the speed of a local optimizer such as SA, merging the previous metaheuristics into a powerful hybrid optimization algorithm. This class of hybrid metaheuristics enabled us to build supersaturated designs for q = 2,3,..., 14 generators. Comparisons are made with previous works and it is shown that the hybrid SAGA is a powerful tool for the construction of E(s(2))-optimal supersaturated designs. (C) 2008 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Journal of Statistical Planning and Inference	en
dc.identifier.doi	10.1016/j.jspi.2008.05.006	en
dc.identifier.isi	ISI:000261348600033	en
dc.identifier.volume	139	en
dc.identifier.issue	2	en
dc.identifier.spage	478	en
dc.identifier.epage	485	en