arrow
返回

Evolutionary dynamic constrained optimization: Test suite construction and algorithm comparisons

delete2019-11-01
delete15
PRE
AI
王
王永 (Yong Wang)
于
于剑 (Jian Yu)
杨
杨圣祥 (Shengxiang Yang) *
S
Shouyong Jiang
赵爽 封面图
赵爽 (Shuang Zhao) *
DOI:10.1016/j.swevo.2019.100559delete
delete原文链接
delete分享
delete收藏
摘要

摘要

En 中文
Many real-world applications can be modelled as dynamic constrained optimization problems (DCOPs). Due to the fact that objective function and/or constraints change over time, solving DCOPs is a challenging task. Although solving DCOPs by evolutionary algorithms has attracted increasing interest in the community of evolutionary computation, the design of benchmark test functions of DCOPs is still insufficient. Therefore, we propose a test suite for DCOPs. A dynamic unconstrained optimization benchmark with good time-varying characteristics, called moving peaks benchmark, is chosen to be the objective function of our test suite. In addition, we design adjustable dynamic constraints, by which the size, number, and change severity of the feasible regions can be flexibly controlled. Furthermore, the performance of three dynamic constrained optimization evolutionary algorithms is tested on the proposed test suite, one of which is presented in this paper, named dynamic constrained optimization differential evolution (DyCODE). DyCODE includes three main phases: 1) the first phase intends to enter the feasible region from different directions promptly via a multi-population search strategy; 2) in the second phase, some excellent individuals chosen from the first phase form a new population to search for the optimal solution of the current environment; and 3) the third phase combines the memory individuals of the first two phases with some randomly generated individuals to re-initialize the population for the next environment. From the experiments, one can understand the strengths and weaknesses of the three compared algorithms for solving DCOPs in depth. Moreover, we also give some suggestions for researchers to apply these three algorithms on different occasions.
Keyword:
Dynamic constrained optimization
Evolutionary algorithms
Benchmark test functions
Performance comparison
Constraint-handling technique
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Swarm and Evolutionary Computation 封面图
Swarm and Evolutionary Computation
IF:
8.5
论文数:
2.3K
被引数:
1.4W

机构

中南大学 封面图
中南大学
学者数:
1.0W
论文数: 2.7K
被引数: 5.9W
D
demontfort university
学者数:
9
论文数: 6
被引数: 1.7K
U
university of lincoln
学者数:
138
论文数: 81
被引数: 2.0K
学者 查看更多机构
引用论文

引用论文

Bio-inspired computation: Where we stand and what's next生物启发的计算: 我们的立场和下一步是什么
err2019-08-01
err438
errOAAI
errDel Ser, Javier; Osaba, Eneko; Molina, Daniel; Yang, Xin-She; Salcedo-Sanz, Sancho; Camacho, David; Das, Swagatam; Suganthan, Ponnuthurai N.; Coello Coello, Carlos A.; Herrera, Francisco
err分享
err收藏
Barriers to Rehabilitation Care in Pediatric Cochlear Implant Recipients
err2018-06-01
err0
errOAAI
errBryce Noblitt; Kristan P. Alfonso; Margaret Adkins; Matthew L. Bush
err分享
err收藏
Differential Evolution With a New Encoding Mechanism for Optimizing Wind Farm Layout
err2018-03-01
err116
errOAAI
errWang, Yong; Liu, Hao; Long, Huan; Zhang, Zijun; Yang, Shengxiang
err分享
err收藏
err1997-01-01
err0
PREAI
errRainer Storn; Kenneth Price
err分享
err收藏
学者 查看更多内容