.png){kind=icon}
.png){kind=icon}
Return
Data Stream driven evolutionary algorithm for cost sensitive robust optimization over time
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2025.101880.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many dynamic optimization problems in real-world domains like engineering and management science require considerations of robustness, where a balance between tracking optimal solutions in changing environments and managing costs of switching solutions is needed. However, in some cases, the objective functions are not analytically available and must be approximated based on data collected from numerical simulations or experiments. These dynamic problems are formulated as data stream driven robust optimization over time (DDROOTS) problems, which cannot be satisfactorily addressed by existing dynamic optimization algorithms. Therefore, we propose a data stream driven multi-form evolutionary algorithm (DDMFEA), employing two separate Kriging models to approximate the unavailable objective function and the computationally expensive robustness estimation, respectively. In the proposed algorithm, DDROOTS problems are addressed with two distinct formulations with single- and multi-objectives. These formulations are utilized as a multi-form optimization process to mitigate the impact of approximation errors from both Kriging models. In addition, a novel solution selection mechanism is designed to consider both robustness and predicted objective values, facilitating the deployment of the optimal robust solution. Throughout the experiment, four robust comparison algorithms are employed to assess the performance of the proposed DDMFEA across various problems in different decision dimensions. The experimental results validate the significance of each proposed contribution and demonstrate the exceptional performance of DDMFEA.
Keywords:
Robust optimization over time
Surrogate-assisted optimization
Dynamic optimization problems
Evolutionary algorithm
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W
View more organizations