A Kriging-assisted Double Population Differential Evolution for Mixed-Integer Expensive Constrained Optimization Problems with Mixed Constraints

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yuanhao Liu , Zan Yang , Danyang Xu , Haobo Qiu , Liang Gao
{"title":"A Kriging-assisted Double Population Differential Evolution for Mixed-Integer Expensive Constrained Optimization Problems with Mixed Constraints","authors":"Yuanhao Liu ,&nbsp;Zan Yang ,&nbsp;Danyang Xu ,&nbsp;Haobo Qiu ,&nbsp;Liang Gao","doi":"10.1016/j.swevo.2023.101428","DOIUrl":null,"url":null,"abstract":"<div><p>Many surrogate-assisted evolutionary algorithms (SAEA) with outstanding performance have been developed to handle Expensive Constrained Optimization Problems (ECOPs). But most of them are limited to solving ECOPs with continuous variables and inequality constraints. Therefore, a Kriging-assisted Double Population Differential Evolution (KDPDE) is proposed to deal with mixed-integer ECOPs with inequality and equality constraints. In particular, promising regions near the feasible region are created by Integer restriction Relaxation-based Double Population (IRDP) search framework, and then an Expected Improvement-based Classification local Search (EICS) is adopted to guide the infeasible solutions in the promising region into the feasible region. In order to improve the robustness of the algorithm, the widely distributed elite solutions are utilized by Elite solutions Retention-based Multi-directional Exploration (ERME) for diverse exploration, and the repetition rate information of individuals in the population is used by Population Diversity Maintenance Operation (PDMO) to adaptively avoid the population from falling into a local region. Therefore, KDPDE is capable of balancing the performance between convergence and robustness for mixed-integer ECOPS with mixed constraints. Experimental studies on several benchmark problems and a real-world application example demonstrate that KDPDE has excellent performance on solving such kind of problems under a limited computational budget.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"84 ","pages":"Article 101428"},"PeriodicalIF":8.2000,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2210650223002006/pdfft?md5=7b6398e413e4180c768351cf8b5cb1ce&pid=1-s2.0-S2210650223002006-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650223002006","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Many surrogate-assisted evolutionary algorithms (SAEA) with outstanding performance have been developed to handle Expensive Constrained Optimization Problems (ECOPs). But most of them are limited to solving ECOPs with continuous variables and inequality constraints. Therefore, a Kriging-assisted Double Population Differential Evolution (KDPDE) is proposed to deal with mixed-integer ECOPs with inequality and equality constraints. In particular, promising regions near the feasible region are created by Integer restriction Relaxation-based Double Population (IRDP) search framework, and then an Expected Improvement-based Classification local Search (EICS) is adopted to guide the infeasible solutions in the promising region into the feasible region. In order to improve the robustness of the algorithm, the widely distributed elite solutions are utilized by Elite solutions Retention-based Multi-directional Exploration (ERME) for diverse exploration, and the repetition rate information of individuals in the population is used by Population Diversity Maintenance Operation (PDMO) to adaptively avoid the population from falling into a local region. Therefore, KDPDE is capable of balancing the performance between convergence and robustness for mixed-integer ECOPS with mixed constraints. Experimental studies on several benchmark problems and a real-world application example demonstrate that KDPDE has excellent performance on solving such kind of problems under a limited computational budget.

混合约束下混合整数昂贵约束优化问题的kriging辅助双种群差分进化
在处理昂贵约束优化问题(ECOPs)方面,已经发展出许多性能优异的代理辅助进化算法(SAEA)。但它们大多局限于求解具有连续变量和不等式约束的ecop。为此,提出了一种kriging辅助的双种群差分进化(KDPDE)方法来处理具有不等式和等式约束的混合整数ECOPs问题。其中,通过基于整数限制松弛的双种群(IRDP)搜索框架在可行区域附近创建有希望区域,然后采用基于期望改进的分类局部搜索(EICS)将有希望区域内的不可行解引导到可行区域。为了提高算法的鲁棒性,利用广泛分布的精英解进行基于精英解保留的多方向探索(ERME),利用种群中个体的重复率信息进行种群多样性维护操作(PDMO),自适应地避免种群陷入局部区域。因此,对于具有混合约束的混合整数ECOPS, KDPDE能够在收敛性和鲁棒性之间取得平衡。对几个基准问题和一个实际应用实例的实验研究表明,在有限的计算预算下,KDPDE在解决这类问题方面具有优异的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术官方微信