arrow
返回

Robust Optimization Over Time: A Critical Review

delete2024-10-01
delete2
delete
OA
AI
D
Danial Yazdani
M
Mohammad Nabi Omidvar
D
D. Yazdani
J
Jürgen Branke
T
Trung Thành Nguyễn
A
Amir H. Gandomi
Y
Yaochu Jin
X
Xin Yao *
DOI:10.1109/TEVC.2023.3306017delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Robust optimization over time (ROOT) is the combination of robust optimization and dynamic optimization. In ROOT, frequent changes to deployed solutions are undesirable, which can be due to the high cost of switching between deployed solutions, limitations on the resources required to deploy new solutions, and/or the system's inability to tolerate frequent changes in the deployed solutions. ROOT is dedicated to the study and development of algorithms capable of dealing with the implications of deploying or maintaining solutions over longer time horizons involving multiple environmental changes. This article presents an in-depth review of the research on ROOT. The overarching aim of this survey is to help researchers gain a broad perspective on the current state of the field, what has been achieved so far, and the existing challenges and pitfalls. This survey also aims to improve accessibility and clarity by standardizing terminology and unifying mathematical notions used across the field, providing explicit mathematical formulations of definitions, and improving many existing mathematical descriptions. Moreover, we classify ROOT problems based on two ROOT-specific criteria: 1) the requirements for changing or keeping deployed solutions and 2) the number of deployed solutions. This classification helps researchers gain a better understanding of the characteristics and requirements of ROOT problems, which is crucial to systematic algorithm design and benchmarking. Additionally, we classify ROOT methods based on the approach they use for finding robust solutions and provide a comprehensive review of them. This survey also reviews ROOT benchmarks and performance indicators. Finally, we identify several future research directions.
Keyword:
Optimization
Surveys
Linear programming
Costs
Uncertainty
Taxonomy
Robustness
Dynamic optimization problems (DOPs)
evolutionary algorithms (EAs)
optimization
robust optimization over time (ROOT)
robust optimization

期刊

IEEE Transactions on Evolutionary Computation 封面图
IEEE Transactions on Evolutionary Computation
IF:
12
论文数:
1.9K
被引数:
2.4W

机构

O
Obuda University
学者数:
655
论文数: 597
被引数: 1.2K
N
natural environment research council (nerc)
学者数:
4.4K
论文数: 3.5K
被引数: 4
U
uk research & innovation (ukri)
学者数:
2.7W
论文数: 2.3W
被引数: 32
U
university of technology sydney
学者数:
1.6W
论文数: 2.0W
被引数: 25
U
university of leeds
学者数:
3.6W
论文数: 3.3W
被引数: 45
U
University of Warwick
学者数:
2.2W
论文数: 2.2W
被引数: 85
N
nerc british antarctic survey
学者数:
1.0K
论文数: 866
被引数: 1
学者 查看更多机构
引用论文

引用论文

Gold self-relay catalysis for accessing functionalized cyclopentenones bearing an all-carbon quaternary stereocenter
err2022-01-01
err0
PREAI
errFan-Tao Meng; Jing-Long Chen; Xiao-Yan Qin; Tian-Shu Zhang; Shu-Jiang Tu; Bo Jiang; Wen-Juan Hao
err分享
err收藏
err分享
err收藏
Water stress effects on chlorophyll fluorescence and chlorophyll content in sugarcane cultivars with contrasting tolerance
err2018-01-01
err0
errOAAI
errMarcelo de Almeida Silva; Renata Passos Pincelli; Alexandrius de Moraes Barbosa
err分享
err收藏
err分享
err收藏
A Survey of Evolutionary Continuous Dynamic Optimization Over Two Decades-Part B
err2021-08-01
err59
errOAAI
errYazdani, Danial; Cheng, Ran; Yazdani, Donya; Branke, Jurgen; Jin, Yaochu; Yao, Xin
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容