解决各种优化问题的混合 PSO-Jaya 算法

E. M. Kazakova
{"title":"解决各种优化问题的混合 PSO-Jaya 算法","authors":"E. M. Kazakova","doi":"10.17587/prin.15.87-96","DOIUrl":null,"url":null,"abstract":"This article proposes a hybrid algorithm PSO-Jaya, based on two heuristic algorithms — PSO (Particle swarm optimization) and Jaya. The main idea of the PSO-Jaya hybrid algorithm is to use PSO for global research of the solutions space and when PSO ceases to improve the results, which indicates a possible hit in the local optimum, Jaya is connected for the best solution throughout space, taking into account the best solutions already found. This allows the hybrid algorithm to combine efficient exploration of large areas of the solution space with the ability to minimize the probability of hitting local optimum. Two problems are used to evaluate the effectiveness of the PSO-Jaya hybrid algorithm: functions optimization and training artificial neural network for classification task Glass Identification. In calculation tests, the PSO, Jaya, PSO-Jaya algorithms are compared in view of their mean, median, standard deviation and \"best\" minimum error. In this connection, 50 simulations-based test functions and 30 network simulations were fulfilled. The performance analysis the PSO and Jaya algorithms was carried out as well as the hybrid algorithm for test-based problems. In all test cases, the PSO-Jaya algorithm achieved the best performance in terms of convergence speed and ability to avoid local optimum.","PeriodicalId":513113,"journal":{"name":"Programmnaya Ingeneria","volume":"40 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hybrid PSO-Jaya Algorithm for Solving Various Optimization Problems\",\"authors\":\"E. M. Kazakova\",\"doi\":\"10.17587/prin.15.87-96\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article proposes a hybrid algorithm PSO-Jaya, based on two heuristic algorithms — PSO (Particle swarm optimization) and Jaya. The main idea of the PSO-Jaya hybrid algorithm is to use PSO for global research of the solutions space and when PSO ceases to improve the results, which indicates a possible hit in the local optimum, Jaya is connected for the best solution throughout space, taking into account the best solutions already found. This allows the hybrid algorithm to combine efficient exploration of large areas of the solution space with the ability to minimize the probability of hitting local optimum. Two problems are used to evaluate the effectiveness of the PSO-Jaya hybrid algorithm: functions optimization and training artificial neural network for classification task Glass Identification. In calculation tests, the PSO, Jaya, PSO-Jaya algorithms are compared in view of their mean, median, standard deviation and \\\"best\\\" minimum error. In this connection, 50 simulations-based test functions and 30 network simulations were fulfilled. The performance analysis the PSO and Jaya algorithms was carried out as well as the hybrid algorithm for test-based problems. In all test cases, the PSO-Jaya algorithm achieved the best performance in terms of convergence speed and ability to avoid local optimum.\",\"PeriodicalId\":513113,\"journal\":{\"name\":\"Programmnaya Ingeneria\",\"volume\":\"40 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Programmnaya Ingeneria\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17587/prin.15.87-96\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Programmnaya Ingeneria","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17587/prin.15.87-96","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文基于两种启发式算法--PSO(粒子群优化)和 Jaya,提出了一种 PSO-Jaya 混合算法。PSO-Jaya 混合算法的主要思想是利用 PSO 对解决方案空间进行全局研究,当 PSO 不再改善结果时(这表明可能进入局部最优状态),Jaya 将在考虑已找到的最佳解决方案的基础上,在整个空间内寻找最佳解决方案。这使得混合算法既能有效探索解决方案空间的大片区域,又能最大限度地降低遇到局部最优的概率。有两个问题被用来评估 PSO-Jaya 混合算法的有效性:功能优化和训练人工神经网络进行玻璃识别分类任务。在计算测试中,比较了 PSO、Jaya 和 PSO-Jaya 算法的平均值、中位数、标准偏差和 "最佳 "最小误差。为此,进行了 50 次基于模拟的测试函数和 30 次网络模拟。对 PSO 和 Jaya 算法以及混合算法进行了性能分析。在所有测试案例中,PSO-Jaya 算法在收敛速度和避免局部最优的能力方面表现最佳。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hybrid PSO-Jaya Algorithm for Solving Various Optimization Problems
This article proposes a hybrid algorithm PSO-Jaya, based on two heuristic algorithms — PSO (Particle swarm optimization) and Jaya. The main idea of the PSO-Jaya hybrid algorithm is to use PSO for global research of the solutions space and when PSO ceases to improve the results, which indicates a possible hit in the local optimum, Jaya is connected for the best solution throughout space, taking into account the best solutions already found. This allows the hybrid algorithm to combine efficient exploration of large areas of the solution space with the ability to minimize the probability of hitting local optimum. Two problems are used to evaluate the effectiveness of the PSO-Jaya hybrid algorithm: functions optimization and training artificial neural network for classification task Glass Identification. In calculation tests, the PSO, Jaya, PSO-Jaya algorithms are compared in view of their mean, median, standard deviation and "best" minimum error. In this connection, 50 simulations-based test functions and 30 network simulations were fulfilled. The performance analysis the PSO and Jaya algorithms was carried out as well as the hybrid algorithm for test-based problems. In all test cases, the PSO-Jaya algorithm achieved the best performance in terms of convergence speed and ability to avoid local optimum.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信