An improved differential evolution and novel crowding distance metric for multi-objective optimization

Chengfu Sun
{"title":"An improved differential evolution and novel crowding distance metric for multi-objective optimization","authors":"Chengfu Sun","doi":"10.1109/KAM.2010.5646140","DOIUrl":null,"url":null,"abstract":"In this paper, an improved differential evolution based on hill-climbing techniques is proposed for multi-objective optimization. Multi-objective differential evolution optimizers are often trapped in local optima and converge slowly. A simple hill-climbing is employed to keep the diversity of population and escape from local optima. A novel crowding-distance computation procedure is proposed in order that the solutions in the neighborhood of the solutions with smallest and largest function values or locating in a lesser crowded region will have higher probability to be preserved. The proposed algorithm is tested on several classical MOP benchmark functions. The simulation results show that the proposed algorithm can obtain the solutions to be widely spread on the true Pareto optimal front‥","PeriodicalId":160788,"journal":{"name":"2010 Third International Symposium on Knowledge Acquisition and Modeling","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Symposium on Knowledge Acquisition and Modeling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KAM.2010.5646140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, an improved differential evolution based on hill-climbing techniques is proposed for multi-objective optimization. Multi-objective differential evolution optimizers are often trapped in local optima and converge slowly. A simple hill-climbing is employed to keep the diversity of population and escape from local optima. A novel crowding-distance computation procedure is proposed in order that the solutions in the neighborhood of the solutions with smallest and largest function values or locating in a lesser crowded region will have higher probability to be preserved. The proposed algorithm is tested on several classical MOP benchmark functions. The simulation results show that the proposed algorithm can obtain the solutions to be widely spread on the true Pareto optimal front‥
一种改进的差分进化和新的多目标优化拥挤距离度量
针对多目标优化问题,提出了一种基于爬坡技术的改进差分进化算法。多目标差分进化优化算法常常陷入局部最优,收敛速度慢。通过简单的爬坡来保持种群的多样性,避免局部最优。为了使最小和最大函数值解的邻域解或位于较不拥挤区域的解具有较高的保留概率,提出了一种新的拥挤距离计算方法。在几个经典的MOP基准函数上对该算法进行了测试。仿真结果表明,所提出的算法能够在真帕累托最优前
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信