基于Agent的改进多目标遗传算法

Li Jia, Lianshuan Shi
{"title":"基于Agent的改进多目标遗传算法","authors":"Li Jia, Lianshuan Shi","doi":"10.1109/ICINIS.2012.50","DOIUrl":null,"url":null,"abstract":"An improved multi-objective Genetic Algorithm based on agent is offered. In the improved algorithm, agents were co-evolution with different control parameters to increase the diversity of candidate solutions. Two kinds of crossover strategies of Arithmetic and Simulated binary (SBX) were introduced in order to complete the competition behavior of the agent, these strategies increased the choice range of the agent, and improved the search performance. To construct non-dominated set, Arena Principle (AP) was used in the process of self-learning behavior, and the clustering method was used to narrow the non-dominated set, so as to obtain the set of Pareto optimal front. The idea of the elitism retaining was used to quicken the convergence rate, and then formed the elitism of individuals, this performance was similarly to the local climbing for self-learning operation. Finally, we saved these individuals to the elitism population, several standard test functions are used to verify this improved algorithm. The results indicated that the improved Genetic Algorithm (GA) obtained good performance.","PeriodicalId":302503,"journal":{"name":"2012 Fifth International Conference on Intelligent Networks and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Improved Multi-objective Genetic Algorithm Based on Agent\",\"authors\":\"Li Jia, Lianshuan Shi\",\"doi\":\"10.1109/ICINIS.2012.50\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An improved multi-objective Genetic Algorithm based on agent is offered. In the improved algorithm, agents were co-evolution with different control parameters to increase the diversity of candidate solutions. Two kinds of crossover strategies of Arithmetic and Simulated binary (SBX) were introduced in order to complete the competition behavior of the agent, these strategies increased the choice range of the agent, and improved the search performance. To construct non-dominated set, Arena Principle (AP) was used in the process of self-learning behavior, and the clustering method was used to narrow the non-dominated set, so as to obtain the set of Pareto optimal front. The idea of the elitism retaining was used to quicken the convergence rate, and then formed the elitism of individuals, this performance was similarly to the local climbing for self-learning operation. Finally, we saved these individuals to the elitism population, several standard test functions are used to verify this improved algorithm. The results indicated that the improved Genetic Algorithm (GA) obtained good performance.\",\"PeriodicalId\":302503,\"journal\":{\"name\":\"2012 Fifth International Conference on Intelligent Networks and Intelligent Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fifth International Conference on Intelligent Networks and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICINIS.2012.50\",\"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 Fifth International Conference on Intelligent Networks and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICINIS.2012.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种改进的基于agent的多目标遗传算法。在改进算法中,智能体通过不同的控制参数进行协同进化,增加了候选解的多样性。为了完成智能体的竞争行为,引入了算法和模拟二进制(SBX)两种交叉策略,增加了智能体的选择范围,提高了搜索性能。为了构建非支配集,在自学习行为过程中采用Arena原理(AP),并采用聚类方法对非支配集进行缩小,从而得到Pareto最优前沿集。利用保留精英主义的思想来加快收敛速度,进而形成个体的精英主义,这种表现类似于局部攀爬进行自我学习操作。最后,我们将这些个体保存到精英群体中,并使用几个标准测试函数来验证改进的算法。结果表明,改进的遗传算法(GA)取得了良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Multi-objective Genetic Algorithm Based on Agent
An improved multi-objective Genetic Algorithm based on agent is offered. In the improved algorithm, agents were co-evolution with different control parameters to increase the diversity of candidate solutions. Two kinds of crossover strategies of Arithmetic and Simulated binary (SBX) were introduced in order to complete the competition behavior of the agent, these strategies increased the choice range of the agent, and improved the search performance. To construct non-dominated set, Arena Principle (AP) was used in the process of self-learning behavior, and the clustering method was used to narrow the non-dominated set, so as to obtain the set of Pareto optimal front. The idea of the elitism retaining was used to quicken the convergence rate, and then formed the elitism of individuals, this performance was similarly to the local climbing for self-learning operation. Finally, we saved these individuals to the elitism population, several standard test functions are used to verify this improved algorithm. The results indicated that the improved Genetic Algorithm (GA) obtained good performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信