基于自适应突变的多目标粒子群优化

D. Saha, Suman Banerjee, N. D. Jana
{"title":"基于自适应突变的多目标粒子群优化","authors":"D. Saha, Suman Banerjee, N. D. Jana","doi":"10.1109/C3IT.2015.7060214","DOIUrl":null,"url":null,"abstract":"In recent decade Evolutionary Algorithms plays an important role in many engineering design and optimization problems. Particle Swarm Optimization (PSO) is one of such algorithm which is based on the intelligent food searching behavior of swarm like birds flock, fish schooling. It has been shown that it works efficiently on noisy, multimodal and composite functions. However, it stuck at local optima at later stage of evolution due to unexplore the search space. Several variations of pso and mutation based approached was developed for this problem. In this paper, an adaptive mutation is proposed for multiobjective pso and called it AMPSO. In AMPSO, mutation is applied on the position and velocity of the particles based on the fitness values of the particles. Proposed algorithm carried on 5 multiobjective benchmark functions. The experimental results shown the better performance comparing with other algorithms in terms of best, mean and standard deviation.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Multi-objective Particle Swarm Optimization based on adaptive mutation\",\"authors\":\"D. Saha, Suman Banerjee, N. D. Jana\",\"doi\":\"10.1109/C3IT.2015.7060214\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent decade Evolutionary Algorithms plays an important role in many engineering design and optimization problems. Particle Swarm Optimization (PSO) is one of such algorithm which is based on the intelligent food searching behavior of swarm like birds flock, fish schooling. It has been shown that it works efficiently on noisy, multimodal and composite functions. However, it stuck at local optima at later stage of evolution due to unexplore the search space. Several variations of pso and mutation based approached was developed for this problem. In this paper, an adaptive mutation is proposed for multiobjective pso and called it AMPSO. In AMPSO, mutation is applied on the position and velocity of the particles based on the fitness values of the particles. Proposed algorithm carried on 5 multiobjective benchmark functions. The experimental results shown the better performance comparing with other algorithms in terms of best, mean and standard deviation.\",\"PeriodicalId\":402311,\"journal\":{\"name\":\"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/C3IT.2015.7060214\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/C3IT.2015.7060214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

近十年来,进化算法在许多工程设计和优化问题中发挥着重要作用。粒子群优化算法(Particle Swarm Optimization, PSO)就是其中一种基于鸟类、鱼群等群体的智能食物搜索行为的算法。结果表明,该方法对噪声函数、多模态函数和复合函数都能有效地处理。然而,由于未探索搜索空间,该算法在进化后期陷入局部最优状态。针对这一问题,提出了几种pso的变体和基于突变的方法。本文提出了一种多目标粒子群的自适应变异算法,称为AMPSO。在AMPSO中,基于粒子的适应度值对粒子的位置和速度进行突变。该算法进行了5个多目标基准函数。实验结果表明,该算法在最佳、均值和标准差方面都优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-objective Particle Swarm Optimization based on adaptive mutation
In recent decade Evolutionary Algorithms plays an important role in many engineering design and optimization problems. Particle Swarm Optimization (PSO) is one of such algorithm which is based on the intelligent food searching behavior of swarm like birds flock, fish schooling. It has been shown that it works efficiently on noisy, multimodal and composite functions. However, it stuck at local optima at later stage of evolution due to unexplore the search space. Several variations of pso and mutation based approached was developed for this problem. In this paper, an adaptive mutation is proposed for multiobjective pso and called it AMPSO. In AMPSO, mutation is applied on the position and velocity of the particles based on the fitness values of the particles. Proposed algorithm carried on 5 multiobjective benchmark functions. The experimental results shown the better performance comparing with other algorithms in terms of best, mean and standard deviation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信