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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
