COMPARATIVE ANALYSIS OF OPTIMIZATION METHODS BY COST (TIME) COSTS OF FULL FACTOR EXPERIMENT PLANS
Keywords:Оptimization, fish school search method, experiment planning, monkey search method, optimal plan, jumping frog method, cost, time.
Relevance. It is proposed to use methods to search for fish schools, monkey searches, jumping frogs for constructing optimal cost (time) experiment plans in the study of technological processes and systems that allow the implementation of an active experiment on them.
The purpose of the work is a comparative analysis of these optimization methods for the cost (time) costs of plans for a full factorial experiment.
Method. Methods are proposed for constructing the cost-effective (time-consuming) implementation of the experiment planning matrix using fish search, monkey search, jumping frogs algorithms. At the beginning, a number of factors and transition costs are entered for each level of factors. Then, taking into account the entered data, the initial planning matrix of the experiment is formed. The fish search method is based on rearranging the columns of the experiment planning matrix, based on the sum of the values (times) of transitions between the levels for each of the factors. The schools of fish are formed according to the following principle: there are fewer schools of fish where the sum of the values (times) of transition between the levels of factors is greater. Then permutations of fish schools located side by side in the experiment planning matrix are performed. When using the monkey search method, the columns of the experiment planning matrix are trees. Each tree consists of branches along which a monkey moves. There are more tree branches where there is less sum of costs (times) of transitions between levels of factors. The monkey begins its movement upward along each branch of the tree. During this, a search is performed on the branches on which the monkey is located by the minimum value of the sum of the values (times) of transitions between the levels for each of the factors. In the jumping frog method, a successful frog is determined by the least cost of transitions between levels for each of the factors. After this, permutations of frogs are performed. The frog strives for the most successful and, provided it is nearby, it remains in its current location. Then the gain is calculated compared to the initial cost (time) of the experiment.
Results. Developed software that implements the proposed methods, 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. Optimum cost plans for the implementation of the experiments were obtained, and the gains in the optimization results compared with the initial cost of the experiment were given. A comparative analysis of optimization methods for the cost (time) costs of plans for a full factorial experiment has been carried out.
Conclusions. The experiments have confirmed the performance of the proposed methods and the software implementing them, and also allow us to recommend them for practical use in constructing optimal experiment planning matrices.
Hoskins D. S. Combinatorics and Statistical Inferecing. London, Applied Optimal Designs, 2007, No. 4, pp. 147–179.
Karpenko A. P. Sovremennye algoritmy poiskovoj optimizacii. Algoritmy, vdohnovlennye prirodoj: uchebnoe posobie. Moscow, izd-vo MGTU im. N. Je. Baumana, 2014, 446 p.
Bailey R. A., Cameron P. G. Combinatorics of optimal designs. London, Surveys in Combinatorics, 2009, Vol. 365, pp. 19–73.
Min-Yuan Cheng, Kuo-Yu Huang and Hung-Ming Chen K-means Optimization with Embedded Chaotic Search for Solving Multidimensional Problems, Applied Mathematics and Computation, 2012, Vol. 219, No. 6, pp. 3091–3099.
Koshevoy N. D., Gordienko V. A., Sukhobrus Ye. A. Optimization for the design of technological processes. Kharkiv, Telecommunications and Radio Engineering, 2014, Vol. 73, No. 15, pp. 1383–1386. DOI: 10.1615 / TelecomRadEng. V73.i15.60.
Gal’chenko V. Ya., Yakimov A. N. Populyacionnie metaevristicheskie algoritmy optimizacii roem chastic, uchebnoe posobiye. Cherkassi, FLP Tretyakov A. N., 2015, 160 p.
Koshoviy M. D., Muratov V. V. Zastosuvannja algoritmu mavpjachogo poshuku dlja optimіzacії planіv povnogo faktornogo eksperimentu. Zbіrnik naukovih prac' Vіjs'kovogo іnstitutu Kiїvs'kogo Nacіonal'nogo unіversitetu іmenі Tarasa Shevchenka. Kyiv, No. 61, pp. 61–70.
Koshevoy N. D., Muratov V. V. Primenenie algoritma prygajushhih ljagushek dlja optimizacii po stoimostnym (vremennym) zatratam planov polnogo faktornogo jeksperimenta. Radіoelektronnі і komp'yuternі sistemi, No. 4, pp. 53–61. DOI: https://doi.org/10.32620/reks.2018.4.05.
Morgan J. P. Association Schemes: Designed Experiments, Algebra and Combinatorics, Journal of the American Statistical Association, 2005, Vol. 100, No. 471, pp. 1092–1093.
Koshevoy N. D., Kostenko E. M. Optimal’noe po stoimostnym i vremennym zatratam planirovanie eksperimenta: monografija. Poltava, izdatel’ Shevchenko R. V., 2013, 317 p.
Shafiq Alam, Gillian Dobbie, Yun Sing Koh, Patricia Riddle Research on Particle Swarm Optimization based clustering: a systematic review of literature and techniques, Swarm and Evolutionary Computation, 2012, Vol. 17, No. 8. pp. 1–13.
Poli R. Analysis of the publications on the applications of optimization. London, Journal of Artificial Evolution and Applications, 2008. pp. 1–10. DOI: 10.1155/2008/685175.
Narimani M. R. A New Modified Shuffle Frog Leaping Algorithm for Non-Smooth Economic Dispath. Dubai, World Applied Sciences Journal, 2011, pp. 803–814.
Alcala-Fdez J., Fernandez A., Luengo J. KEEL Data-мining software Tool: data, set repository, integration of algorithms and experimental analysis framework, Valued Logic & Soft Computing, 2011, Vol. 17, pp. 255–287.
How to Cite
Copyright (c) 2020 Н. Д. Кошевой, Е. М. Костенко, В. В. Муратов, А. М. Крюков, А. И. Биленко, А. А. Морозов
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.