具有动态变异的距离引导粒子群优化算法

Chunhe Song, Hai Zhao, Wei Cai, Haohua Zhang, Ming Zhao, Wei Gao, Xuanjie Ning, Xudong Han, Peng Zhu, Jie Gao, Tianyu Qi, Hongyan Gong
{"title":"具有动态变异的距离引导粒子群优化算法","authors":"Chunhe Song, Hai Zhao, Wei Cai, Haohua Zhang, Ming Zhao, Wei Gao, Xuanjie Ning, Xudong Han, Peng Zhu, Jie Gao, Tianyu Qi, Hongyan Gong","doi":"10.1109/IIH-MSP.2007.292","DOIUrl":null,"url":null,"abstract":"This paper presents a distance-guided particle swarm optimizer with dynamic mutation (PSODM). Two characteristics are proposed in the PSODM: distance-guided and dynamic mutation. The goal of these characteristics is to overcome premature convergence of the swarm and accelerating the convergence velocity. With distance-guided operation, some particles too intense can be separated, while with dynamic mutation operation, the particles mutated can find a better position more easily by effectively using the foregone experience. The PSODM is compared to other four types of improved PSO, and the experimental results show that the PSODM performances better on a six-function test suite with different dimensions.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Distance-Guided Particle Swarm Optimizer with Dynamic Mutation\",\"authors\":\"Chunhe Song, Hai Zhao, Wei Cai, Haohua Zhang, Ming Zhao, Wei Gao, Xuanjie Ning, Xudong Han, Peng Zhu, Jie Gao, Tianyu Qi, Hongyan Gong\",\"doi\":\"10.1109/IIH-MSP.2007.292\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a distance-guided particle swarm optimizer with dynamic mutation (PSODM). Two characteristics are proposed in the PSODM: distance-guided and dynamic mutation. The goal of these characteristics is to overcome premature convergence of the swarm and accelerating the convergence velocity. With distance-guided operation, some particles too intense can be separated, while with dynamic mutation operation, the particles mutated can find a better position more easily by effectively using the foregone experience. The PSODM is compared to other four types of improved PSO, and the experimental results show that the PSODM performances better on a six-function test suite with different dimensions.\",\"PeriodicalId\":385132,\"journal\":{\"name\":\"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIH-MSP.2007.292\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIH-MSP.2007.292","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种带动态变异的距离引导粒子群优化算法(PSODM)。提出了PSODM的两个特征:距离引导和动态突变。这些特性的目的是克服群体的过早收敛,加快收敛速度。距离引导操作可以分离一些强度过大的粒子,而动态突变操作可以有效地利用先验经验,使突变的粒子更容易找到更好的位置。将改进的PSODM与其他四种改进的PSODM进行了比较,实验结果表明,PSODM在不同维度的六功能测试套件上表现更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Distance-Guided Particle Swarm Optimizer with Dynamic Mutation
This paper presents a distance-guided particle swarm optimizer with dynamic mutation (PSODM). Two characteristics are proposed in the PSODM: distance-guided and dynamic mutation. The goal of these characteristics is to overcome premature convergence of the swarm and accelerating the convergence velocity. With distance-guided operation, some particles too intense can be separated, while with dynamic mutation operation, the particles mutated can find a better position more easily by effectively using the foregone experience. The PSODM is compared to other four types of improved PSO, and the experimental results show that the PSODM performances better on a six-function test suite with different dimensions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信