COMPARATIVE ANALYSIS OF OPTIMIZATION METHODS IN THE INVESTIGATION OF A WEIGHMEASURING SYSTEM AND THERMOREGULATOR
Keywords:метод, оптимизация, рой частиц, планирование экспериментов, табу-поиск, оптимальный план, случайный поиск, стоимость.
AbstractContext. For the first time, the use of taboo-search methods, random search, a swarm of particles for the construction of costeffective
experiment plans for the study of a weighing system and a temperature regulator was proposed.
Objective – to carry out a comparative analysis of the developed optimization methods, such as taboo search, random search,
particle swarm when searching for the optimal plans for the experiment during the study of the weighing system and thermostat.
Method. Methods for constructing the experimentally optimal implementation matrix for the experiment using algorithms of a
swarm of particles, taboo search and random search are proposed. In the beginning, the number of factors and cost of transitions for
each level of factors is introduced. Then, taking into account the input data, the initial experimental design matrix is formed. When
using the taboo search algorithm at each iteration step, the best solution in the neighborhood of the current solution is chosen as the
new current solution and the check is made whether it is in the taboo list. Thus, calculations occur until the algorithm reaches the
specified number of iterations. The list of taboos is formed from decisions that have a minimum cost. The random search method is
based on permuting the columns of the planning matrix. The number of iterations of the algorithm is specified by the user. The
method of the particle swarm is based on modeling the behavior of the particle population. At each point where the particle visited,
the value of the experiment is calculated. In this case, each particle remembers which (and where) the best value of the cost of the
experiment, she personally found and where the point is located, which is the best among all the points that explored the particles. At
each iteration, the particles correct their velocity (modulus and direction). After a certain number of iterations, the particles are collected
near the best point. Then, among all the new points, we check whether we have found a new globally better point, and if
found, remember its coordinates and the value of the cost of conducting the experiment in it. Then the gain is calculated in comparison
with the initial cost of the experiment.
Results. The software that implements the proposed methods was developed, which was used to conduct computational experiments
to study the properties of these methods in the study of a weighing system and a temperature regulator. Optimized for the cost
of implementation of the experiment plans were synthesized, as well as the gains in optimization results as compared to the initial
and maximum costs of the experiment.
Conclusions. The conducted experiments confirmed the efficiency of the proposed methods and the software that implements
them, and also allow them to be recommended for application in practice when constructing optimal experimental design matrices.
Hoskins D. S. Combinatorics and Statistical Inferecing.
Applied Optimal Designs, 2007, Vol. 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, Vol. 365, pp. 19–73.
Koshevoy N. D., Kostenko E. M., Gordienko V. A., Syroklyn V. P. Optimum planning of experiment in manufacturing the electronic equipment, Telecommunications and Radio
Engineering, 2011, Vol. 170, No. 8, pp. 731–734.
Koshevoy N. D., Gordienko V. A., Sukhobrus Ye. A., Optimization for the design matrix realization value with the aim to investigate technological processes, Telecommunications and Radio Engineering, 2014, Vol. 73, No. 15, pp. 1383–1386.
Koshevoj N. D., Kostenko E. M., Optimal’noe po stoimostnym i vremennym zatratam planirovanie jeksperimenta. Poltava, izdatel’ Shevchenko R. V., 2013, 317 p.
Poli, R. An analysis of publications on particle swarm optimisation applications. Technical Report CSM-469 (Department of Computer Science, University of Essex, UK). may 2007.
Poli R. Analysis of the publications on the applications of particle swarm optimisation, Journal of Artificial Evolution and Applications, 2008, pp. 1–10.
Gal’chenko V. Ja., Jakimov A. N., 2015. Populjacionnye metajevresticheskie algoritmy optimizacii roem chastic: Uchebnoe posobie. Cherkassy, FLP Tretjakov A. N., 160 р.
Shi X. H., Liang Y. C., Lee H. P., Particle swarm optimization based algorithms for TPS and generalized TPS, Information Processing Letters, 2007, Vol. 103, pp. 169–176.
Koshevoj N. D., Kostenko E. M., Weighing system. Patent 58098 UA, MPK: G01F 11/00, 2010.
Barabashhuk V. Y’, Kredencer B. P., Plany’rovany`e
ekspery’menta v texny’ke. Kiev, Tehnika, 1984, 200 p.
How to Cite
Copyright (c) 2019 N. D. Koshevoy, E. M. Kostenko, A. A. Beliaieva
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.