A hybrid version of differential evolution with two differential mutation operators applied by stages

S. Hernández, G. Leguizamón, E. Mezura-Montes
{"title":"A hybrid version of differential evolution with two differential mutation operators applied by stages","authors":"S. Hernández, G. Leguizamón, E. Mezura-Montes","doi":"10.1109/CEC.2013.6557921","DOIUrl":null,"url":null,"abstract":"Differential Evolution (DE) is an algorithm capable of solving complex optimization problems with and without constraints. As many of the population-based algorithms, DE is based on operators that evolve a numerical population through search operators. The differential mutation, one of the basic operators in the original version of the algorithm, provides population diversity through the evolution. In this paper we propose an extended version of a previously proposed hybrid DE including know two different mutation operators, which are not applied simultaneously. The first of them, our main contribution, is based on the exploitation of feasible areas to identify promising regions of search space. The second mutation operator is the classic differential mutation and it is applied towards produce a balance between exploration and exploitation as well as to improve the individuals obtained with our operator. An experimental study was performed by considering 18 functions presented for the “Single Objective Constrained Real-Parameter Optimization” of the special session of CEC2010. The results are compared with those obtained by Takahama and Sakai, winners that CEC2010 special session with εDEag algorithm. The obtained results show that our proposed approach is capable of finding solutions of higher quality for scalable problems of dimension 30 whereas the results for dimension 10 remains competitive with εDEag.","PeriodicalId":211988,"journal":{"name":"2013 IEEE Congress on Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2013.6557921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Differential Evolution (DE) is an algorithm capable of solving complex optimization problems with and without constraints. As many of the population-based algorithms, DE is based on operators that evolve a numerical population through search operators. The differential mutation, one of the basic operators in the original version of the algorithm, provides population diversity through the evolution. In this paper we propose an extended version of a previously proposed hybrid DE including know two different mutation operators, which are not applied simultaneously. The first of them, our main contribution, is based on the exploitation of feasible areas to identify promising regions of search space. The second mutation operator is the classic differential mutation and it is applied towards produce a balance between exploration and exploitation as well as to improve the individuals obtained with our operator. An experimental study was performed by considering 18 functions presented for the “Single Objective Constrained Real-Parameter Optimization” of the special session of CEC2010. The results are compared with those obtained by Takahama and Sakai, winners that CEC2010 special session with εDEag algorithm. The obtained results show that our proposed approach is capable of finding solutions of higher quality for scalable problems of dimension 30 whereas the results for dimension 10 remains competitive with εDEag.
微分进化的混合版本,由两个不同阶段的微分突变操作符应用
差分进化(DE)是一种能够求解有约束和无约束的复杂优化问题的算法。与许多基于种群的算法一样,DE是基于通过搜索操作符进化数字种群的操作符。差分突变是原始算法中的基本算子之一,通过进化提供种群多样性。在本文中,我们提出了先前提出的混合DE的扩展版本,其中包括两个不同的突变算子,它们不是同时应用的。其中第一个,我们的主要贡献,是基于可行区域的开发,以确定搜索空间的有前途的区域。第二种变异算子是经典的微分变异算子,它用于在勘探和开发之间取得平衡,并改进我们的算子获得的个体。针对CEC2010专场“单目标约束实参数优化”提出的18个函数进行了实验研究。将结果与用εDEag算法求解CEC2010特别会议的优胜者Takahama和Sakai的结果进行了比较。得到的结果表明,我们提出的方法能够为30维的可扩展问题找到更高质量的解,而10维的结果仍然与εDEag具有竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信