APPLICATION OF THE “JUMPING FROGS” ALGORITHM FOR RESEARCH AND OPTIMIZATION OF THE TECHNOLOGICAL PROCESS
DOI:
https://doi.org/10.15588/1607-3274-2021-1-6Keywords:
optimal plan, jumping frogs search algorithm, optimization, experiment planning, cost, win.Abstract
Context. An application of the method of a “jumping frogs” search algorithm to construct optimal experiment plans for cost (time) in the study of technological processes and systems that allow the implementation of an active experiment on them is proposed.
The object of study are optimization methods for cost (time) costs of experimental designs, based on the application of a “jumping frogs” search algorithm.
Objective. To obtain optimization results by optimizing the search of a “jumping frogs” search algorithm for the cost (time) costs of plans for a full factorial experiment.
Method. A method is proposed for constructing a cost-effective (time) implementation of an experiment planning matrix using algorithms for searching for “jumping frogs”. At the beginning, the number of factors and the cost of transitions for each factor level are entered. Then, taking into account the entered data, the initial experiment planning matrix is formed. Then, taking into account the entered data, the initial matrix of experiment planning is formed. The “jumping frogs” method determines the “successful frog” by the lowest cost of transitions between levels for each of the factors. After that, the permutations of the “frogs” are performed. The “frog” strives for the most “successful” and, provided it stays close, remains in the location. Then the gain is calculated in comparison with the initial cost (time) of the experiment.
Results. Software has been developed that implements the proposed method, which was used to conduct computational experiments to study the properties of these methods in the study of technological processes and systems that allow the implementation of an active experiment on them. The experimental designs that are optimal in terms of cost (time) are obtained, and the winnings in the optimization results are compared with the initial cost of the experiment. A comparative analysis of optimization methods for the cost (time) costs of plans for a full factorial experiment is carried out.
Conclusions. The conducted experiments confirmed the operability of the proposed method and the software that implements it, and also allows us to recommend it for practical use in constructing optimal experiment planning matrices.
References
Bona M. Combinatorics of permutations. N.-Y., CRC Press, 2012, 478 p.
Berger P. D., Maurer R. E. Experimental Design with Applications in Management, Engineering and the Sciences. Celli New York, Springer, 2018, 640 p.
Hoskins D. S. Combinatorics and Statistical Inferecing, Applied Optimal Designs, 2007, No. 4, pp. 147–179.
Bailey R. A., Cameron P. G. Combinatorics of optimal designs, Surveys in Combinatorics, 2009, Vol. 365, pp. 19– 73.
Morgan J. P. Association Schemes: Designed Experiments, Algebra and Combinatorics, Journal of the American Statistical Association, 2005, Vol. 100, No. 471, pp. 1092– 1093.
Rodrigues M. I., Iemma A. F. Experimental Design and Process Optimization. N.-Y., CRC Press, 2016, 336 p.
Yakovlev S. V. Properties of combinatorial optimization problems over polyhedral-spherical sets, Cybernetics and Systems Analysis, 2018, Vol. 54, No. 1, pp. 99–109.
Yakovlev S. V. Convex extensions in combinatorial optimization and their, Springer Optimization and its Applications, 2017, Vol. 130, pp. 567–584.
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
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
Montgomery D. C. Design and Analysis of Experiments, 9th Edition. Wiley, 2017, 629 p.
Koshevoy N. D. Primenenie algoritma prygajushhih ljagushek dlja optimizacii po stoimostnym (vremennym) zatratam planov polnogo faktornogo jeksperimenta, Radioelektronni i komp’uterni sistemi – Radioelectronic and computer systems, 2018, No. 4, pp. 53–61. DOI: 10.32620/reks.2018.4.05
Koshevoy N. D. Zastosuvannja algoritmu mavpjachogo poshuku dlja optimіzacії planіv povnogo faktornogo eksperimentu, Zbіrnik naukovih prac’ Vіjs’kovogo іnstitutu Kiivs’kogo Nacіonal’nogo unіversitetu іmenі Tarasa Shevchenka – Collection of Scientific Papers of the Military Institute Military Institute of Taras Shevchenko National University of Kyiv, 2018, No. 61, pp. 61–69.
Karpenko A. P. Sovremennye algoritmy poiskovoj optimizacii. Algoritmy, vdohnovlennye prirodoj: uchebnoe posobie. Moscow, izd-vo MGTU im. N. Je. Baumana, 2014, 446 p.
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, Control, 2020, No. 1, pp. 54–62. DOI: 10.15588/1607-3274-2020-1-6
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/16073274-2020-2-5
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 М. Д. Кошовий , В. В. Муратов , О. Л. Кириченко , С. А. Борісенко
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.
