2016
DOI: 10.1080/00401706.2015.1044116
|View full text |Cite
|
Sign up to set email alerts
|

A Note on Foldover of 2kpDesigns With Column Permutations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(11 citation statements)
references
References 17 publications
0
11
0
Order By: Relevance
“…To remove the complete words in our concatenated designs, we apply sign switches to the generated factors in one or more parent designs. This is because, for a 2 m−p design with possibly permuted factors, sign switches in any set of factors are equivalent to sign switches in a set that only contains generated factors (Li and Lin, 2016) The total number of sets of generated factors for which the signs can be switched in d copies of a 2 m−p design is 2 pd . Evaluating the sign switches in all possible subsets of these factors is computationally infeasible when d > 3 and p > 9.…”
Section: Algorithmic Improvement Of Designsmentioning
confidence: 99%
“…To remove the complete words in our concatenated designs, we apply sign switches to the generated factors in one or more parent designs. This is because, for a 2 m−p design with possibly permuted factors, sign switches in any set of factors are equivalent to sign switches in a set that only contains generated factors (Li and Lin, 2016) The total number of sets of generated factors for which the signs can be switched in d copies of a 2 m−p design is 2 pd . Evaluating the sign switches in all possible subsets of these factors is computationally infeasible when d > 3 and p > 9.…”
Section: Algorithmic Improvement Of Designsmentioning
confidence: 99%
“…In this section, we first evaluate the performance of our CC/VNS algorithm to generate the best 32-and 64-run concatenated designs with up to 11 factors from strength-3 regular designs with 16 and 32 runs. To this end, we compare our concatenated designs to those obtained by Li and Lin (2016). Next, we assess the performance of our algorithm to generate the best 128-run concatenated designs with up to 30 factors from regular and nonregular designs of strength 3 with 64 runs.…”
Section: Performance Of the Cc/vns Algorithmmentioning
confidence: 99%
“…Their approach involves a complete enumeration of all possible selections of columns in which to switch the signs of the elements. Li and Lin (2016) suggested to also permute the columns of the second parent design before switching the signs in the selected columns.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations