Opposition based Chaotic Differential Evolution algorithm for solving global optimization problems

R. Thangaraj, M. Pant, T. Chelliah, A. Abraham
{"title":"Opposition based Chaotic Differential Evolution algorithm for solving global optimization problems","authors":"R. Thangaraj, M. Pant, T. Chelliah, A. Abraham","doi":"10.1109/NaBIC.2012.6402168","DOIUrl":null,"url":null,"abstract":"A modified differential evolution (DE) algorithm based on opposition based learning and chaotic sequence named Opposition based Chaotic Differential Evolution (OCDE) is proposed. The proposed OCDE algorithm is different from basic DE in two aspects. First is the generation of initial population, which follows Opposition Based Learning (OBL) rules; and the second is: dynamic adaption of scaling factor F using chaotic sequence. The numerical results obtained by OCDE when compared with the results obtained by DE and ODE (opposition based DE) algorithms on eighteen benchmark function demonstrate that the OCDE is able to find a better solution while maintaining a reasonable convergence rate.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaBIC.2012.6402168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

A modified differential evolution (DE) algorithm based on opposition based learning and chaotic sequence named Opposition based Chaotic Differential Evolution (OCDE) is proposed. The proposed OCDE algorithm is different from basic DE in two aspects. First is the generation of initial population, which follows Opposition Based Learning (OBL) rules; and the second is: dynamic adaption of scaling factor F using chaotic sequence. The numerical results obtained by OCDE when compared with the results obtained by DE and ODE (opposition based DE) algorithms on eighteen benchmark function demonstrate that the OCDE is able to find a better solution while maintaining a reasonable convergence rate.
基于对立的混沌微分进化算法求解全局优化问题
提出了一种基于对立学习和混沌序列的改进差分进化算法——基于对立的混沌差分进化算法。本文提出的OCDE算法与基本的DE算法有两个不同之处。首先是初始群体的生成,遵循基于对立的学习(OBL)规则;二是利用混沌序列对比例因子F进行动态自适应。将OCDE算法在18个基准函数上得到的数值结果与DE算法和ODE(基于对立的DE)算法得到的结果进行比较,表明OCDE算法能够在保持合理收敛速度的情况下找到更好的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信