Devising methods for planning a multifactorial multilevel experiment with high dimensionality
DOI:
https://doi.org/10.15587/1729-4061.2021.242304Keywords:
planning of multifactorial multilevel experiment, problem with high dimensionality, decomposition plan, exact planAbstract
This paper considers the task of planning a multifactorial multilevel experiment for problems with high dimensionality. Planning an experiment is a combinatorial task. At the same time, the catastrophically rapid growth in the number of possible variants of experiment plans with an increase in the dimensionality of the problem excludes the possibility of solving it using accurate algorithms. On the other hand, approximate methods of finding the optimal plan have fundamental drawbacks. Of these, the main one is the lack of the capability to assess the proximity of the resulting solution to the optimal one. In these circumstances, searching for methods to obtain an accurate solution to the problem remains a relevant task.
Two different approaches to obtaining the optimal plan for a multifactorial multilevel experiment have been considered. The first of these is based on the idea of decomposition. In this case, the initial problem with high dimensionality is reduced to a sequence of problems of smaller dimensionality, solving each of which is possible by using precise algorithms. The decomposition procedure, which is usually implemented empirically, in the considered problem of planning the experiment is solved by employing a strictly formally justified technique. The exact solutions to the problems obtained during the decomposition are combined into the desired solution to the original problem. The second approach directly leads to an accurate solution to the task of planning a multifactorial multilevel experiment for an important special case where the costs of implementing the experiment plan are proportional to the total number of single-level transitions performed by all factors. At the same time, it has been proven that the proposed procedure for forming a route that implements the experiment plan minimizes the total number of one-level changes in the values of factors. Examples of problem solving are given
References
- Nalimov, V. V., Chernova, N. A. (1965). Statisticheskie metody planirovaniya ekstremal'nyh eksperimentov. Moscow: Nauka, 340.
- Adleman, L. (1994). Molecular computation of solutions to combinatorial problems. Science, 266 (5187), 1021–1024. doi: https://doi.org/10.1126/science.7973651
- Levitin, A. V. (2006). Algoritmy: vvedenie v razrabotku i analiz. Moscow: Vil'yams, 576.
- Kureychik, V. M., Lebedev, B. K., Lebedev, O. K. (2006). Poiskovaya adaptaciya: teoriya i praktika. Moscow: Fizmatlit, 272.
- Kormen, T., Leyzerson, Ch., Rivest, R., Shtayn, K. (2006). Algoritmy: postroenie i analiz. Moscow: Vil'yam, 1296.
- Smith, K. (1918). On the standard deviations of adjusted and interpolated values of an observed polynomial function and its constants and the guidance they give towards a proper choice of the distribution of observations. Biometrika, 12 (1-2), 1–85. doi: https://doi.org/10.1093/biomet/12.1-2.1
- How to Use “Design of Experiments” to Create Robust Designs With High Yield. Available at: https://www.youtube.com/watch?v=hfdZabCVwzc
- Simmons, J. P., Nelson, L. D., Simonsohn, U. (2011). False-Positive Psychology: Undisclosed Flexibility in Data Collection and Analysis Allows Presenting Anything as Significant. Psychological Science, 22 (11), 1359–1366. doi: https://doi.org/10.1177/0956797611417632
- Physics envy: Do ‘hard’ sciences hold the solution to the replication crisis in psychology? Available at: https://www.theguardian.com/science/head-quarters/2014/jun/10/physics-envy-do-hard-sciences-hold-the-solution-to-the-replication-crisis-in-psychology
- Montgomery, D. C. (2012). Design and analysis of experiments. Wiley, 752.
- Blum, C. (2005). Ant colony optimization: Introduction and recent trends. Physics of Life Reviews, 2 (4), 353–373. doi: https://doi.org/10.1016/j.plrev.2005.10.001
- Saymon, D. (2020). Algoritmy evolyucionnoy optimizacii. Moscow: LVR Press, 940.
- Durbin, R., Willshaw, D. (1987). An analogue approach to the travelling salesman problem using an elastic net method. Nature, 326 (6114), 689–691. doi: https://doi.org/10.1038/326689a0
- Zadeh, L. A. (1965). Fuzzy sets. Information and Control, 8 (3), 338–353. doi: https://doi.org/10.1016/s0019-9958(65)90241-x
- Pawlak, Z. (1997). Rough set approach to knowledge-based decision support. European Journal of Operational Research, 99 (1), 48–57. doi: https://doi.org/10.1016/s0377-2217(96)00382-7
- Raskin, L., Sira, O. (2016). Fuzzy models of rough mathematics. Eastern-European Journal of Enterprise Technologies, 6 (4 (84)), 53–60. doi: https://doi.org/10.15587/1729-4061.2016.86739
- Raskin, L., Sira, O. (2016). Method of solving fuzzy problems of mathematical programming. Eastern-European Journal of Enterprise Technologies, 5 (4 (83)), 23–28. doi: https://doi.org/10.15587/1729-4061.2016.81292
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 Lev Raskin, Oksana Sira
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.
