Modification of particle swarm algorithm basedon hierarchy analysis method
DOI:
https://doi.org/10.17308/sait.2019.4/2679Keywords:
optimization problem, particle swarm optimization algorithm, genetic algorithm, analytic hierarchy process, leader training, conjugate gradient method, embedment hybridization, sequential hybridization, coalgorithmic hybridizationAbstract
There are problems of mathematical modeling, the solution of which necessitates finding the maximum or minimum point of some function of many variables. For example, this is training artificial neural networks, identifying the parameters of mathematical models from experimental data, and finding the optimal control for these models. To quickly find the extremum point, a lot of population optimization algorithms have been developed (particle swarm optimization (PSO), genetic algorithm and others). A modification of the particle swarm optimization algorithm based on the hierarchy analysis method is proposed. The scheme of the developed algorithm is inspired by the behavior of freshwater hydras; therefore, the authors propose to call it the H-algorithm. Successive and parallel (co-algorithmic) hybridization of the developed algorithm with the genetic algorithm using real coding (RGA) is performed. For the considered algorithms, a high-level hybridization by embedding is implemented, in which a local search is carried out in the vicinity of an agent with the best value of the objective function using the conjugate gradient method (leader training). Comparison of the effectiveness of the considered methods was per-formed on the example of various multi-extreme test functions (the function of Rosenbrock, Davis, Ackley, Rastrigin). PSO, RGA and H-algorithm for different test functions showed different, but on average the same convergence rate. Leader training significantly increased the convergence rate of all algorithms. The best results in convergence rate were shown by parallel and serial hybridization of the RGA and the H-algorithm.
References
Mahmood, S. A. Neural Network with PSO based training to detect spoofing websites / S. A. Mahmood, N. G. M. Jameel, S. J. Sayda // Journal of Theoretical and Applied Information Technology. – 2018. – Vol. 96(12). – P. 3612–3622.
Syulistyo, A. R. Particle swarm optimization (PSO) for training optimization on convolutional neural network (CNN) / A. R. Syulistyo, D. M. J. Purnomo, M. F. Rachmadi, A. Wibowo // Journal of Computer Science and Information. – 2016. – Vol. 9(1). – P. 52–58. – DOI.
Ibrahim, A. M. Particle Swarm Optimization trained recurrent neural network for voltage instability prediction / A. M. Ibrahim, N. H. El-Amary // Journal of Electrical Systems and Information Technology. – 2018. – Vol. 5(2). – P. 216–228. – DOI.
Королев, С. А. Метод идентификации параметров модели метаногенеза в виде системы дифференциальных уравнений на основе генетического алгоритма / С. А. Королев, Д. В. Майков // Интеллектуальные системы в производстве. – 2012. – No1. – С. 29–35.
Кетова, К. В. Идентификация и прогнозирование обобщающих показателей развития региональной экономической системы / К. В. Кетова, И. Г. Русяк // Прикладная эконометрика. – 2009. – №3 (15). – С. 56–71.
Королев, С. А. Оптимизация двухстадийного режима метаногенеза на основе принципа максимума Понтрягина / С. А. Королев, Д. В. Майков // Вестник Донского государственного технического университета. – 2019. – Т. 19, №2. – С. 195–203.
Nezhadhosein, S. Integrating differential evolution algorithm with modified hybrid GA for solving nonlinear optimal control problems / S. Nezhadhosein, A. Heydari, R. Ghanbari // Iranian Journal of Mathematical Sciences and Informatics. – 2017. – Vol. 12, No. 1. – P. 47–67. – DOI..
Salehpour, E. Solving optimal control problems by PSO-SVM / E. Salehpour, J. Vahidi, H. Hosseinzadeh // Computational Methods for Differential Equations. – 2018. – Vol. 6(3). – P. 312–325.
Сайранов, А. С. Применение генетических алгоритмов для управления организационными системами при возникновении нештатных ситуаций / А. С. Сайранов, Е. В. Касаткина, Д. Г. Нефедов, И. Г. Русяк // Компьютерные исследования и моделирование. – 2019. – Т. 11, № 3. – С. 533–556.
Yao, S. W. An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix / S. W. Yao, L. S. Ning // Journale Computational and Applied Mathematics. – 2018. – Vol. 332. – P. 72–85.
Карпенко, А. П. Современные алгоритмы поисковой оптимизации. Алгоритмы, вдохновленные природой: учебное пособие / А. П. Карпенко. – 2-е изд. – Москва: Изд-во МГТУ имени М. Э. Баумана, 2017. – 446 с.
Kennedy, J. Particle swarm optimization / J. Kennedy, R. C. Eberhart // Proceedings of IEEE International Conference on Neural Networks. – 1995. – P. 1942–1948.
Hussain, A. Optimization through Genetic Algorithm with a New and Efficient Cross-over Operator / A. Hussain, Y. S. Muhammad, A. Nawaz // International Journal of Advances in Mathematics. – 2018. – Vol. 2018(1). – P. 1–14.
Li, X. An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem / X. Li, L. Gao // International Journal of Production Economics. – 2016. – Vol. 174. – P. 93–110.
Kundakci, N. Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem / N. Kundakci, O. Kulak // Computers & Industrial Engineering. – 2016. – Vol. 96. – P. 31–51.
Sano, M. Balancing setup workers load of flexible job shop scheduling using hybrid genetic algorithm with tabu search strategy / M. Sano, M. Nagao, Y. Morinaga // International Journal of Decision Support Systems. – 2016. – Vol. 2(1). – P. 71–90.
Саати, Т. Принятие решений. Метод анализа иерархий / Т. Саати. – Москва: Радио и связь, 1993. – 278 с.18. Дауда, Т. А. Зоология беспозвоночных: учебное пособие / Т. А. Дауда, А. Г. Кощаев. – Москва: Лань, 2014. – 208 с.
Downloads
Published
Issue
Section
License
Условия передачи авторских прав in English













