返回
Evolutionary approach for dynamic constrained optimization problems
DOI:10.1016/j.aej.2022.10.072.png)
摘要
En 中文
The number of research works on dynamic constrained optimization problems has been increasing rapidly over the past two decades. In this domain, many real-life decision problems need to be solved repeatedly with changing data and parameters. However, no research on dynamic problems with changes in the coefficients of the constraint functions has been reported. In this paper, to deal with such problems, a new evolutionary framework with multiple novel mechanisms is proposed. The new mechanisms are for (1) dealing with both linear and non-linear components in the constraint functions, (2) identifying the rate of change in the coefficients of the variables and (3) updating the population efficiently after every change occurs in the problem. To evaluate the per-formance of the proposed algorithm, we designed a new set of 13 dynamic benchmark problems, each of which consists of 20 dynamic changes and 3 different scenarios. The results demonstrate that the proposed algorithm significantly contributes in achieving good quality solutions, high fea-sibility rates and fast convergence in rapidly changing environments. In addition, the framework shows its capability of using different meta-heuristics to solve dynamic problems.(c) 2022 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Alexandria University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/ licenses/by-nc-nd/4.0/).
Keyword:
Dynamic optimization
Constrained optimization
Evolutionary algorithms
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.8
论文数:
6.3K
被引数:
3.2W
机构
暂无机构信息
引用论文
A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms关于使用非参数统计检验作为比较进化和群体智能算法的方法的实用教程
Sensitivity-Based Change Detection for Dynamic Constrained Optimization基于灵敏度的动态约束优化变化检测
IEEE ACCESS
IF3.6

