THE METHOD OF BUILDING PLANS OF MULTIFACTORIAL EXPERIMENTS WITH MINIMAL NUMBER OF FACTOR LEVELS MEASUREMENTS AND OPTIMAL BY COST (TIME) EXPENSES
Keywords:Method, optimal plan of experiment, factor levels, transformations, set, cost, time, software.
Context. Relevant task of developing the method of plans building for multifactorial experiments was solved with minimal number of factor levels measurements and optimal by cost (time) expenses.
Objective. To develop method and means of synthesis the plans of multifactorial experiment with minimal number of factor levels measurements and optimal by cost (time) expenses.
Methods. Methods of experiment planning gives possibility to reduce cost (time) expenses when researching different technological processes, devices and systems.
Quantity of factor levels measurements minimization during the process of building the plans of multifactorial experiments also leads to cost (time) reduction on their implementation.
Suggested earlier method of building the plans of multifactorial experiments, based on Grey code application, provides a possibility to minimize number of factor levels measurements. But such plans are not always optimal in relation to cost (time) expenses. That’s why the task appears to develop a method and means of synthesis the plans of multifactorial experiment with minimal number of factor levels measurements and optimal by cost (time) expenses.
Essence of a suggested method consists of: generation of permutations with minimal number of transpositions for neighbor elements; number of factor level variations is determined for each obtained plan by calculating the distance after Hamming for neighbor pairs of binary words; recording the plan with minimal number of factor levels measurements into set D; analysis of binary codes that enter set D, among which codes, received form Grey code by E, H and (E, H) transformations are present; searching among modified Grey codes G(E, H) such codes, that are optimal by cost (time) expenses.
Results. Software which performs the suggested method of building the plans with minimal number of factor levels measurements and optimal by cost (time) expenses was developed. Software allows to synthesize optimal plans of experiment with k = 3,…, 4 number of factors.
Conclusions. Computer experiments, that were carried out to build optimal plans to research such an objects as production of pieces by hot press forming technological process and a tracking system proved workability and effectiveness both of the developed method and software for its performance.
Scientific novelty is represented by method, that allows to synthesize plans of multifactorial experiments with minimal number of factor levels measurements and optimal by cost (time) expenses.
Practical importance of the results is that developed software can find wide application for technological processes, devices and systems researching, if it is possible to implement active experiment.
Hoskins D. S. Combinatorics and Statistical Inferecing, Applied Optimal Designs, 2007, No. 4, pp. 147–179.
Morgan J. P. Association Schemes: Designed Experiments, Algebra and Combinatorics, Journal of the American Statistical Association, 2005, Vol.100, No. 471, pp. 1092– 1093.
Bailey R. A., Cameron P. G. Combinatorics of optimal designs, Surveys in Combinatorics, 2009, V.365, pp. 19–73.
Montgomery D. C. Design and Analysis of Experiments, 9th Edition. Wiley, 2017, 629 p.
Bartos B. J., Cleary R. Mc. , Dowall D. Mc. Design and analysis of time series experiments. Oxford, Oxford University Press, 2017, 393 p.
Berger P. D., Maurer R. E. Experimental Design with Applications in Management, Engineering and the Sciences. Celli New York, Springer, 2018, 640 p.
Rodrigues M. I., Iemma A. F. Experimental Design and Process Optimization. N.-Y., CRC Press, 2016, 336 p.
Wu C. F. J., Hamada M. S. Experiments: Planning, Analysis, and Opti-mization. Wiley, 2015, 743 p.
Karpenko A. P. Sovremennye algoritmy poiskovoj optimizacii. Algoritmy, vdohnovlennye prirodoj: uchebnoe posobie. Moscow, izd-vo MGTU im. N. Je. Baumana, 2014, 446 p.
Halchenko Y. Ya., Trembovetska R. V., Tychkov V. V. Development of excitations structure RBF-metamodels of inoving concentriced dycurrent probe, Electrical
engeneering & electromechanics, 2019, No. 2, pp. 28–38. DOI: 10.20998/2074-272X.2019.2.05
Jones B. C., Nachtsheim C. J. Efficient designs with minimal aliasing, Technometrics, 2011, No. 53, pp. 62–71.
Koshevoy М., Zabolotnyi O. , Tsekhovskyi M. et al. Research and optimization of the eddy current transducer of dielectric coatings′ thickness on metal surfaces of products, Ukrainian Metrological Journal, 2020, No. 2, pp. 33–39. DOI:10.24027/2306-7039.2.2020.208935
Koshevoy N. D., Kostenko E. M., Muratov V. V. Application of the fish search method for optimization plans of the full factor experiment, Radio Electronics, Computer Science, Control, 2020, No. 2, pp. 44–55. DOI: 10.15588/1607-3274-2020-2-5
Koshevoy N. D., Kostenko E. M., Pavlyk A. V. et al Research of multiple plans in multi-factor experiments with a minimum number of transitions of levels of factors, Radio Electronics, Computer Science, Control, 2019, No. 2, pp. 53–59. DOI:10.15588/1607-3274-2019-2-6
Koshevoy N. D., Kostenko E. M., Muratov V.V. et al. Сomparative analysis of optimization methods by cost (time) costs of full factor experiment plans, Radio Electronics, Computer Science, Contro, 2020, No. 1, pp. 54–62. DOI: 10.15588/1607-3274-2020-1-6
Bona M. Combinatorics of permutations. N.-Y., CRC Press, 2012, 478 p.
How to Cite
Copyright (c) 2020 N. D. Koshevoy, V. A. Dergachov, H. V. Pavlyk, O. V. Zabolotnyi, I. I. Koshevaya, Е. М. Kostenko
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.