An enhanced differential evolution algorithm with adaptation of switching crossover strategy for continuous optimization

IF 1.8 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
P. Puphasuk, J. Wetweerapong
{"title":"An enhanced differential evolution algorithm with adaptation of switching crossover strategy for continuous optimization","authors":"P. Puphasuk, J. Wetweerapong","doi":"10.2478/fcds-2020-0007","DOIUrl":null,"url":null,"abstract":"Abstract Designing an efficient optimization method which also has a simple structure is generally required by users for its applications to a wide range of practical problems. In this research, an enhanced differential evolution algorithm with adaptation of switching crossover strategy (DEASC) is proposed as a general-purpose population-based optimization method for continuous optimization problems. DEASC extends the solving ability of a basic differential evolution algorithm (DE) whose performance significantly depends on user selection of the control parameters: scaling factor, crossover rate and population size. Like the original DE, the proposed method is aimed at e ciency, simplicity and robustness. The appropriate population size is selected to work in accordance with good choices of the scaling factors. Then, the switching crossover strategy of using low or high crossover rates are incorporated and adapted to suit the problem being solved. In this manner, the adaptation strategy is just a convenient add-on mechanism. To verify the performance of DEASC, it is tested on several benchmark problems of various types and di culties, and compared with some well-known methods in the literature. It is also applied to solve some practical systems of nonlinear equations. Despite its much simpler algorithmic structure, the experimental results show that DEASC greatly enhances the basic DE. It is able to solve all the test problems with fast convergence speed and overall outperforms the compared methods which have more complicated structures. In addition, DEASC also shows promising results on high dimensional test functions.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"45 1","pages":"124 - 97"},"PeriodicalIF":1.8000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Computing and Decision Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/fcds-2020-0007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract Designing an efficient optimization method which also has a simple structure is generally required by users for its applications to a wide range of practical problems. In this research, an enhanced differential evolution algorithm with adaptation of switching crossover strategy (DEASC) is proposed as a general-purpose population-based optimization method for continuous optimization problems. DEASC extends the solving ability of a basic differential evolution algorithm (DE) whose performance significantly depends on user selection of the control parameters: scaling factor, crossover rate and population size. Like the original DE, the proposed method is aimed at e ciency, simplicity and robustness. The appropriate population size is selected to work in accordance with good choices of the scaling factors. Then, the switching crossover strategy of using low or high crossover rates are incorporated and adapted to suit the problem being solved. In this manner, the adaptation strategy is just a convenient add-on mechanism. To verify the performance of DEASC, it is tested on several benchmark problems of various types and di culties, and compared with some well-known methods in the literature. It is also applied to solve some practical systems of nonlinear equations. Despite its much simpler algorithmic structure, the experimental results show that DEASC greatly enhances the basic DE. It is able to solve all the test problems with fast convergence speed and overall outperforms the compared methods which have more complicated structures. In addition, DEASC also shows promising results on high dimensional test functions.
一种用于连续优化的自适应切换交叉策略的改进差分进化算法
设计一种高效、结构简单的优化方法是用户普遍要求的,因为它适用于广泛的实际问题。本文提出了一种基于切换交叉策略的增强型差分进化算法(DEASC),作为连续优化问题的通用优化方法。DEASC扩展了基本差分进化算法(DE)的求解能力,后者的性能很大程度上取决于用户选择的控制参数:比例因子、交叉率和种群规模。与原始DE相似,本文提出的方法以高效、简单和鲁棒性为目标。根据比例因子的选择,选择合适的种群规模进行工作。然后,结合并调整使用低或高交叉率的切换交叉策略以适应所要解决的问题。在这种情况下,适应策略只是一种方便的附加机制。为了验证DEASC算法的性能,在不同类型和难度的几个基准问题上进行了测试,并与文献中一些知名的方法进行了比较。该方法也被用于求解一些实际的非线性方程组。尽管算法结构简单,但实验结果表明,DEASC大大提高了基本DE,能够以较快的收敛速度解决所有测试问题,总体上优于结构更复杂的比较方法。此外,DEASC在高维测试函数上也显示出良好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Foundations of Computing and Decision Sciences
Foundations of Computing and Decision Sciences COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
2.20
自引率
9.10%
发文量
16
审稿时长
29 weeks
×
引用
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学术官方微信