.png){kind=icon}
返回
A framework for finding robust optimal solutions over time
.png){kind=icon}
PRE
AI
DOI：10.1007/s12293-012-0090-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Dynamic optimization problems (DOPs) are those whose specifications change over time, resulting in changing optima. Most research on DOPs has so far concentrated on tracking the moving optima (TMO) as closely as possible. In practice, however, it will be very costly, if not impossible to keep changing the design when the environment changes. To address DOPs more practically, we recently introduced a conceptually new problem formulation, which is referred to as robust optimization over time (ROOT). Based on ROOT, an optimization algorithm aims to find an acceptable (optimal or sub-optimal) solution that changes slowly over time, rather than the moving global optimum. In this paper, we propose a generic framework for solving DOPs using the ROOT concept, which searches for optimal solutions that are robust over time by means of local fitness approximation and prediction. Empirical investigations comparing a few representative TMO approaches with an instantiation of the proposed framework are conducted on a number of test problems to demonstrate the advantage of the proposed framework in the ROOT context.
Keyword:
Robust optimisation over time (Root)
Dynamic optimisation
Evolutionary algorithms
Particle swarm optimisation
Fitness approximation
期刊
IF:
2.3
论文数:
453
被引数:
718
机构
引用论文
3500 yr record of centennial-scale climate variability from the Western Pacific Warm Pool.png)
Geology
GeologyIF0
PREAI
分享收藏Autocrine TNF-α production supports CML stem and progenitor cell survival and enhances their proliferationBlood
OAAI
BloodIF0
OAAI分享收藏
查看更多内容