一种新的基于黄金分割局部搜索的粒子群优化算法

Yanxia Sun, B. J. Wyk, Zenghui Wang
{"title":"一种新的基于黄金分割局部搜索的粒子群优化算法","authors":"Yanxia Sun, B. J. Wyk, Zenghui Wang","doi":"10.1109/ICSAI.2012.6223120","DOIUrl":null,"url":null,"abstract":"At beginning of the search process of particle swarm optimization, one of the disadvantages is that PSO focuses on the global search while the local search is weakened. However, at the end of the search procedure, the PSO focuses on the local search as almost all the particles converge into small areas which could cause the particle swarm to be trapped in the local minima if no particle is found near the minima at the beginning of the search procedure. To improve the optimization performance, the local search is necessary for particle swarm optimization. In this paper, the golden ratio is used to determine the size of the search area. Only two positions need to be checked in order to find whether there are local positions with lower fitness value around a certain particle position. It is also tested using several well-known benchmarks with high dimensions and a large search space for the efficiency of the proposed method.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A new golden ratio local search based particle swarm optimization\",\"authors\":\"Yanxia Sun, B. J. Wyk, Zenghui Wang\",\"doi\":\"10.1109/ICSAI.2012.6223120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"At beginning of the search process of particle swarm optimization, one of the disadvantages is that PSO focuses on the global search while the local search is weakened. However, at the end of the search procedure, the PSO focuses on the local search as almost all the particles converge into small areas which could cause the particle swarm to be trapped in the local minima if no particle is found near the minima at the beginning of the search procedure. To improve the optimization performance, the local search is necessary for particle swarm optimization. In this paper, the golden ratio is used to determine the size of the search area. Only two positions need to be checked in order to find whether there are local positions with lower fitness value around a certain particle position. It is also tested using several well-known benchmarks with high dimensions and a large search space for the efficiency of the proposed method.\",\"PeriodicalId\":164945,\"journal\":{\"name\":\"2012 International Conference on Systems and Informatics (ICSAI2012)\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Systems and Informatics (ICSAI2012)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSAI.2012.6223120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Systems and Informatics (ICSAI2012)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSAI.2012.6223120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

粒子群优化算法在初始搜索过程中,缺点之一是注重全局搜索,弱化局部搜索。然而,在搜索过程结束时,粒子群算法主要集中在局部搜索,因为几乎所有的粒子都收敛到很小的区域内,如果在搜索过程开始时没有在最小值附近找到粒子,则可能导致粒子群被困在局部最小值中。为了提高优化性能,粒子群优化必须进行局部搜索。本文采用黄金分割率来确定搜索区域的大小。只需要检查两个位置,就可以找到某个粒子位置周围是否存在适应度值较低的局部位置。本文还使用几个著名的高维和大搜索空间的基准测试来测试所提出方法的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new golden ratio local search based particle swarm optimization
At beginning of the search process of particle swarm optimization, one of the disadvantages is that PSO focuses on the global search while the local search is weakened. However, at the end of the search procedure, the PSO focuses on the local search as almost all the particles converge into small areas which could cause the particle swarm to be trapped in the local minima if no particle is found near the minima at the beginning of the search procedure. To improve the optimization performance, the local search is necessary for particle swarm optimization. In this paper, the golden ratio is used to determine the size of the search area. Only two positions need to be checked in order to find whether there are local positions with lower fitness value around a certain particle position. It is also tested using several well-known benchmarks with high dimensions and a large search space for the efficiency of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信