Construction of optimal run order in design of experiments

Jiayu Peng, Dennis K.J. Lin

Research output: Contribution to journalArticle

Abstract

It is sometimes favorable to conduct experiments in a systematic run order rather than the conventional random run order. In this article, we propose an algorithm to construct the optimal run order. The algorithm is very flexible: it is applicable to any design and works whenever the optimality criterion can be represented as distance between any two experimental runs. Specifically, the proposed method first formulates the run order problem into a graph, then makes use of the existing traveling salesman problem-solver to obtain the optimal run order. It can always reach the optimal result in an efficient manner. A special case where level change is used as the distance criterion is investigated thoroughly. The optimal run orders for popular two-level designs are obtained and tabulated for practical use. For higher- or mixed-level designs a generic table is not possible, although the proposed algorithm still works well for finding the optimal run order. Some supporting theoretical results are derived.

Original languageEnglish (US)
Pages (from-to)159-170
Number of pages12
JournalJournal of Quality Technology
Volume51
Issue number2
DOIs
StatePublished - Jan 1 2019

Fingerprint

Design of experiments
Traveling salesman problem
Experiments

All Science Journal Classification (ASJC) codes

  • Safety, Risk, Reliability and Quality
  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

@article{aee3def21f3e43b797ae29ebba4fc25b,
title = "Construction of optimal run order in design of experiments",
abstract = "It is sometimes favorable to conduct experiments in a systematic run order rather than the conventional random run order. In this article, we propose an algorithm to construct the optimal run order. The algorithm is very flexible: it is applicable to any design and works whenever the optimality criterion can be represented as distance between any two experimental runs. Specifically, the proposed method first formulates the run order problem into a graph, then makes use of the existing traveling salesman problem-solver to obtain the optimal run order. It can always reach the optimal result in an efficient manner. A special case where level change is used as the distance criterion is investigated thoroughly. The optimal run orders for popular two-level designs are obtained and tabulated for practical use. For higher- or mixed-level designs a generic table is not possible, although the proposed algorithm still works well for finding the optimal run order. Some supporting theoretical results are derived.",
author = "Jiayu Peng and Lin, {Dennis K.J.}",
year = "2019",
month = "1",
day = "1",
doi = "10.1080/00224065.2018.1541381",
language = "English (US)",
volume = "51",
pages = "159--170",
journal = "Journal of Quality Technology",
issn = "0022-4065",
publisher = "American Society for Quality",
number = "2",

}

Construction of optimal run order in design of experiments. / Peng, Jiayu; Lin, Dennis K.J.

In: Journal of Quality Technology, Vol. 51, No. 2, 01.01.2019, p. 159-170.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Construction of optimal run order in design of experiments

AU - Peng, Jiayu

AU - Lin, Dennis K.J.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - It is sometimes favorable to conduct experiments in a systematic run order rather than the conventional random run order. In this article, we propose an algorithm to construct the optimal run order. The algorithm is very flexible: it is applicable to any design and works whenever the optimality criterion can be represented as distance between any two experimental runs. Specifically, the proposed method first formulates the run order problem into a graph, then makes use of the existing traveling salesman problem-solver to obtain the optimal run order. It can always reach the optimal result in an efficient manner. A special case where level change is used as the distance criterion is investigated thoroughly. The optimal run orders for popular two-level designs are obtained and tabulated for practical use. For higher- or mixed-level designs a generic table is not possible, although the proposed algorithm still works well for finding the optimal run order. Some supporting theoretical results are derived.

AB - It is sometimes favorable to conduct experiments in a systematic run order rather than the conventional random run order. In this article, we propose an algorithm to construct the optimal run order. The algorithm is very flexible: it is applicable to any design and works whenever the optimality criterion can be represented as distance between any two experimental runs. Specifically, the proposed method first formulates the run order problem into a graph, then makes use of the existing traveling salesman problem-solver to obtain the optimal run order. It can always reach the optimal result in an efficient manner. A special case where level change is used as the distance criterion is investigated thoroughly. The optimal run orders for popular two-level designs are obtained and tabulated for practical use. For higher- or mixed-level designs a generic table is not possible, although the proposed algorithm still works well for finding the optimal run order. Some supporting theoretical results are derived.

UR - http://www.scopus.com/inward/record.url?scp=85065137916&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85065137916&partnerID=8YFLogxK

U2 - 10.1080/00224065.2018.1541381

DO - 10.1080/00224065.2018.1541381

M3 - Article

AN - SCOPUS:85065137916

VL - 51

SP - 159

EP - 170

JO - Journal of Quality Technology

JF - Journal of Quality Technology

SN - 0022-4065

IS - 2

ER -