A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation

The responses obtained from response surface designs that are run sequentially often exhibit serial correlation or time trends. The order in which the runs of the design are performed then has an impact on the precision of the parameter estimators. This article proposes the use of a variable-neighbourhood search algorithm to compute run orders that guarantee a precise estimation of the effects of the experimental factors. The importance of using good run orders is demonstrated by seeking D-optimal run orders for a central composite design in the presence of an AR(1) autocorrelation pattern.

Publication year:2008

Keywords:A1 Journal article

BOF-keylabel:yes

BOF-publication weight:0.5

CSS-citation score:1

Accessibility:Closed