This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

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

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Garroi J.-J.
Goos P.
Sörensen K.

Additional information is available for the following registered author(s):

Abstract

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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.ua.ac.be/download.aspx?c=*TEWHI&n=39157&ct=39867&e=112294
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by University of Antwerp, Faculty of Applied Economics in its series Working Papers with number 2006026.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 23 pages
Date of creation: Oct 2006
Date of revision:
Handle: RePEc:ant:wpaper:2006026

Contact details of provider:
Postal: Prinsstraat 13, B-2000 Antwerpen
Web page: http://www.ua.ac.be/tew
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Joeri Nys).

Related research
Keywords:

This paper has been announced in the following NEP Reports:

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
  1. Fleszar, Krzysztof & Hindi, Khalil S., 2004. "Solving the resource-constrained project scheduling problem by a variable neighbourhood search," European Journal of Operational Research, Elsevier, vol. 155(2), pages 402-413, June. [Downloadable!] (restricted)
  2. Avanthay, Cedric & Hertz, Alain & Zufferey, Nicolas, 2003. "A variable neighborhood search for graph coloring," European Journal of Operational Research, Elsevier, vol. 151(2), pages 379-388, December. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? All RePEc services are meant to be be free forever, as they are all run by volunteers.

This page was last updated on 2009-12-2.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.