NUMERICAL OPTIMIZATION ALGORITHM AND PROGRAM IMPLEMENTING THE PARTICLE SWAR OPTIMIZATION
Article Sidebar
Main Article Content
Abstract
One of the numerical optimization methods is considered, which implements the so-called particle swarm method. A modification of the method based on the division of the iterative calculation process into two stages is proposed. To speed up calculations and reduce their complexity. At the first stage, the objective function is replaced by a simplified model, which allows you to quickly determine the approximate area of extremum localization. The final solution is sought in the found localization area, using the original objective function. A console application that implements the algorithm is described and the results of numerical experiments performed using this application are presented.
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
References
Kennedy, J., & Eberhart, R. (1995) Particle swarm optimization. Proceedings of ICNN'95 – International Conference on Neural Networks: Vol. 4 (1942–1948). DOI: 10.1109/ICNN.1995.488968.
Kennedy, J., & Eberhart, R.C. (2001) Swarm Intelligence. Morgan Kaufmann.
Poli, R. (2007) An analysis of publications on particle swarm optimisation applications. Technical Report CSM-469. Department of Computer Science, University of Essex, UK.
Poli, R. (2008) Analysis of the Publications on the Applications of Particle Swarm Optimisation. Journal of Artificial Evolution and Applications, 1–10. DOI: 10.1155/2008/685175.
Os'kin, A. F. (2004) Algoritmy priblizheniya elementov matritsy komponentami dvukh vektorov [Algorithms for Approximation of Matrix Elements by Components of Two Vectors] Vestnik Polotskogo gosudarstvennogo universiteta. Seriya C, Fundamental'nye nauki [Herald of Polotsk State University. Series С. Fundamental sciences], (4), 73–76. (In Russ., abstr. in Engl.).