基于角度偏好和三档案集的多目标粒子群优化算法

Jing Li, Yan Yang, Jie Hu
{"title":"基于角度偏好和三档案集的多目标粒子群优化算法","authors":"Jing Li, Yan Yang, Jie Hu","doi":"10.1109/ISKE47853.2019.9170447","DOIUrl":null,"url":null,"abstract":"Multi-objective optimization problems (MOP) have not been completely solved due to their complexity. The evolutionary algorithm simulates the motor foraging mode of the biological group, which has certain advantages for solving the MOP, and can obtain the ε-pareto optimal solution. Particle swarm optimization (PSO) is well suitable for some evolutionary algorithms because of its fast convergence. Considering convergence, diversity and user preference information of multiple targets, we propose multi-objective particle swarm optimization algorithm with angle preference and three-archive sets (APTPSO). The validity of AP-TPSO is described by calculating the GD and SP values of the standard test functions.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-Objective Particle Swarm optimization Algorithm Based on Angle Preference and Three-Archive Sets\",\"authors\":\"Jing Li, Yan Yang, Jie Hu\",\"doi\":\"10.1109/ISKE47853.2019.9170447\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multi-objective optimization problems (MOP) have not been completely solved due to their complexity. The evolutionary algorithm simulates the motor foraging mode of the biological group, which has certain advantages for solving the MOP, and can obtain the ε-pareto optimal solution. Particle swarm optimization (PSO) is well suitable for some evolutionary algorithms because of its fast convergence. Considering convergence, diversity and user preference information of multiple targets, we propose multi-objective particle swarm optimization algorithm with angle preference and three-archive sets (APTPSO). The validity of AP-TPSO is described by calculating the GD and SP values of the standard test functions.\",\"PeriodicalId\":399084,\"journal\":{\"name\":\"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE47853.2019.9170447\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE47853.2019.9170447","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

多目标优化问题由于其复杂性一直没有得到完全的解决。该进化算法模拟了生物群体的运动觅食模式,对求解MOP具有一定的优势,可以得到ε-pareto最优解。粒子群算法具有快速收敛的特点,适用于一些进化算法。考虑到多目标的收敛性、多样性和用户偏好信息,提出了具有角度偏好和三档案集的多目标粒子群优化算法(APTPSO)。通过计算标准测试函数的GD和SP值来描述AP-TPSO的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multi-Objective Particle Swarm optimization Algorithm Based on Angle Preference and Three-Archive Sets
Multi-objective optimization problems (MOP) have not been completely solved due to their complexity. The evolutionary algorithm simulates the motor foraging mode of the biological group, which has certain advantages for solving the MOP, and can obtain the ε-pareto optimal solution. Particle swarm optimization (PSO) is well suitable for some evolutionary algorithms because of its fast convergence. Considering convergence, diversity and user preference information of multiple targets, we propose multi-objective particle swarm optimization algorithm with angle preference and three-archive sets (APTPSO). The validity of AP-TPSO is described by calculating the GD and SP values of the standard test functions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Incremental Learning for Transductive SVMs ISKE 2019 Table of Contents Consensus: The Minimum Cost Model based Robust Optimization A Learned Clause Deletion Strategy Based on Distance Ratio Effects of Real Estate Regulation Policy of Beijing Based on Discrete Dependent Variables Model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1