基于两个最优解的旋转变换混沌粒子群优化

Nao Kinoshita, K. Tatsumi
{"title":"基于两个最优解的旋转变换混沌粒子群优化","authors":"Nao Kinoshita, K. Tatsumi","doi":"10.1109/SMC42975.2020.9283041","DOIUrl":null,"url":null,"abstract":"In this paper, we discuss the particle swarm optimization method (PSO) for global optimization, especially, a PSO using a perturbation-based chaotic updating system called PSO-SDPC. In this method, it is easy to select appropriate parameter values for effective search, and numerical experiments showed its good search ability. However, the search of the PSO-SDPC is not rotation-invariant because the perturbation terms of the chaotic updating system are added along the coordinate system of the standard basis, and the component-wise selection from the chaotic and the standard PSO updating systems for a particle’s position deeply depends on the coordinate systemTherefore, in this paper, we improve the PSO-SDPC: the perturbations are added along a new coordinate system that is selected according to two best solutions, and all components of each particle’s position are updated by the same system, which is selected from the two updating systems. Moreover, we show that the proposed method can be regarded as the rotation-invariant and keeps a high search ability for many problems through numerical experiments.","PeriodicalId":6718,"journal":{"name":"2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","volume":"47 1","pages":"1135-1140"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Chaotic particle swarm optimization using a rotation transformation based on two best solutions\",\"authors\":\"Nao Kinoshita, K. Tatsumi\",\"doi\":\"10.1109/SMC42975.2020.9283041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we discuss the particle swarm optimization method (PSO) for global optimization, especially, a PSO using a perturbation-based chaotic updating system called PSO-SDPC. In this method, it is easy to select appropriate parameter values for effective search, and numerical experiments showed its good search ability. However, the search of the PSO-SDPC is not rotation-invariant because the perturbation terms of the chaotic updating system are added along the coordinate system of the standard basis, and the component-wise selection from the chaotic and the standard PSO updating systems for a particle’s position deeply depends on the coordinate systemTherefore, in this paper, we improve the PSO-SDPC: the perturbations are added along a new coordinate system that is selected according to two best solutions, and all components of each particle’s position are updated by the same system, which is selected from the two updating systems. Moreover, we show that the proposed method can be regarded as the rotation-invariant and keeps a high search ability for many problems through numerical experiments.\",\"PeriodicalId\":6718,\"journal\":{\"name\":\"2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)\",\"volume\":\"47 1\",\"pages\":\"1135-1140\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SMC42975.2020.9283041\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMC42975.2020.9283041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文讨论了用于全局优化的粒子群优化方法(PSO),特别是使用基于微扰的混沌更新系统PSO- sdpc的粒子群优化方法。该方法易于选择合适的参数值进行有效搜索,数值实验表明该方法具有良好的搜索能力。然而,由于混沌更新系统的摄动项是沿标准基坐标系添加的,因此PSO- sdpc的搜索不是旋转不变的,并且从混沌更新系统和标准PSO更新系统中对粒子位置的组件选择深度依赖于坐标系。因此,本文对PSO- sdpc进行了改进:扰动沿着一个根据两个最佳解选择的新坐标系添加,并且每个粒子位置的所有分量由同一系统更新,该系统从两个更新系统中选择。此外,通过数值实验表明,所提出的方法可以看作是旋转不变量的,并且对许多问题保持较高的搜索能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Chaotic particle swarm optimization using a rotation transformation based on two best solutions
In this paper, we discuss the particle swarm optimization method (PSO) for global optimization, especially, a PSO using a perturbation-based chaotic updating system called PSO-SDPC. In this method, it is easy to select appropriate parameter values for effective search, and numerical experiments showed its good search ability. However, the search of the PSO-SDPC is not rotation-invariant because the perturbation terms of the chaotic updating system are added along the coordinate system of the standard basis, and the component-wise selection from the chaotic and the standard PSO updating systems for a particle’s position deeply depends on the coordinate systemTherefore, in this paper, we improve the PSO-SDPC: the perturbations are added along a new coordinate system that is selected according to two best solutions, and all components of each particle’s position are updated by the same system, which is selected from the two updating systems. Moreover, we show that the proposed method can be regarded as the rotation-invariant and keeps a high search ability for many problems through numerical experiments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信