IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

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

  • GARROI, Jean-Jacques
  • GOOS, Peter
  • SÖRENSEN, Kenneth

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.

If you experience problems downloading a file, check if you have the proper application to view it first. 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: https://www.uantwerpen.be/images/uantwerpen/container1244/files/TEW%20-%20Onderzoek/Working%20Papers/RPS/2006/RPS-2006-026.pdf
Our checks indicate that this address may not be valid because: 500 Can't connect to www.uantwerpen.be:443. If this is indeed the case, please notify (Joeri Nys)


Download Restriction: no

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

as
in new window

Length: 24 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: https://www.uantwerp.be/en/faculties/applied-economic-sciences/

More information through EDIRC

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.:

as in new window
  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.
  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.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2006026. 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)

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

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 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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.