.png){kind=icon}
.png){kind=icon}
Return
Robust Optimization Over Time by Learning Problem Space Characteristics
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2018.2843566.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Robust optimization over time is a new way to tackle dynamic optimization problems where the goal is to find solutions that remain acceptable over an extended period of time. The state-of-the-art methods in this domain try to identify robust solutions based on their future predicted fitness values. However, predicting future fitness values is difficult and error prone. In this paper, we propose a new framework based on a multipopulation method in which subpopulations are responsible for tracking peaks and also gathering characteristic information about them. When the quality of the current robust solution falls below the acceptance threshold, the algorithm chooses the next robust solution based on the collected information. We propose four different strategies to select the next solution. The experimental results on benchmark problems show that our newly proposed methods perform significantly better than existing algorithms.
Keywords:
Dynamic optimization problems (DOPs)
particle swarm optimization (PSO)
robust optimization over time (ROOT)
tracking moving optima (TMO)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W