APPLICATION PARTICLE SWARM ALGORITHM TO MINIMIZE THE COST OF CONDUCTING MULTIVARIATE EXPERIMENT
Науковий журнал «Радіоелектроніка, інформатика, управління»
Переглянути архів Інформація| Поле | Співвідношення | |
| ##plugins.schemas.marc.fields.042.name## |
dc |
|
| ##plugins.schemas.marc.fields.245.name## |
APPLICATION PARTICLE SWARM ALGORITHM TO MINIMIZE THE COST OF CONDUCTING MULTIVARIATE EXPERIMENT |
|
| ##plugins.schemas.marc.fields.720.name## |
Koshevoy, N. D.; National Aerospace University named after
M. E. Zhukovskoho “HAI”, Kharkiv, Ukraine Beliaieva, A. A.; National Aerospace University named after M. E. Zhukovskoho “HAI”, Kharkiv, Ukraine |
|
| ##plugins.schemas.marc.fields.653.name## |
method optimization; swarm particle; experimental design; cost; optimal plan |
|
| ##plugins.schemas.marc.fields.520.name## |
Context. The actual problem of obtaining a sequence of experiments in the conduct of a full factor experiment ensuring its minimum cost<br />has been solved.<br />Objective – is to create a method for optimizing multifactor experimental plans using an optimization algorithm for the particle swarm.<br />Method. A method is proposed for constructing an optimal experiment design matrix for the cost of implementation using the particle<br />swarm algorithm. The particle swarm method is based on modeling the behavior of the particle population in the parameter space of the<br />optimization problem. In the beginning, the number of factors and the cost of the transition for each level of factors are introduced. Then,<br />taking into account the input data, a composite matrix of experiment planning is formed. The particles are scattered randomly across the<br />entire composite experiment design matrix and each particle has a random velocity vector. After that, the particles begin to move along the<br />rows and columns of the matrix. At each point where the particle visited, the value of the experiment is calculated. In this case, each particle<br />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 (module and direction) in order to be closer to the best point on the one hand, which she found herself and, at the same time, to approach the point that is currently globally<br />better. After a certain number of iterations, the particles are collected near the best point. Then the current coordinate of each particle is<br />corrected. After this, the cost of the experiment is calculated at each new point, each particle checks whether the new coordinate has become<br />the best among all the points where it visited. Then, among all the new points, we check whether we have found a new globally better point,<br />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<br />with the initial cost of the experiment.<br />Results. The software that implements the proposed method is developed, which was used in carrying out computational experiments to<br />study the properties of the method.<br />Conclusions. The conducted experiments confirmed the efficiency of the proposed method and the software that implements it, and also<br />allow them to be recommended for application in practice when constructing optimal experimental design matrices. |
|
| ##plugins.schemas.marc.fields.260.name## |
Zaporizhzhya National Technical University 2018-05-29 13:24:17 |
|
| ##plugins.schemas.marc.fields.856.name## |
application/pdf http://ric.zntu.edu.ua/article/view/131546 |
|
| ##plugins.schemas.marc.fields.786.name## |
Radio Electronics, Computer Science, Control; No 1 (2018): Radio Electronics, Computer Science, Control |
|
| ##plugins.schemas.marc.fields.546.name## |
ru |
|
| ##plugins.schemas.marc.fields.540.name## |
Copyright (c) 2018 N. D. Koshevoy, A. A. Beliaieva |
|