0 Datasets
0 Files
Get instant academic access to this publication’s datasets.
Yes. After verification, you can browse and download datasets at no cost. Some premium assets may require author approval.
Files are stored on encrypted storage. Access is restricted to verified users and all downloads are logged.
Yes, message the author after sign-up to request supplementary files or replication code.
Join 50,000+ researchers worldwide. Get instant access to peer-reviewed datasets, advanced analytics, and global collaboration tools.
✓ Immediate verification • ✓ Free institutional access • ✓ Global collaborationJoin our academic network to download verified datasets and collaborate with researchers worldwide.
Get Free AccessMany real-world optimization problems are dynamic. The field of robust optimization over time (ROOT) deals with dynamic optimization problems in which frequent changes of the deployed solution are undesirable. This can be due to the high cost of switching the deployed solutions, the limitation of the needed resources to deploy such new solutions, and/or the system being intolerant towards frequent changes of the deployed solution. In the considered ROOT problems in this article, the main goal is to find solutions that maximize the average number of environments where they remain acceptable. In the state-of-the-art methods developed to tackle these problems, the decision makers/metrics used to select solutions for deployment mostly make simplifying assumptions about the problem instances. Besides, the current methods all use the population control components which have been originally designed for tracking the global optimum over time without taking any robustness considerations into account. In this paper, a multi-population ROOT method is proposed with two novel components: a robustness estimation component that estimates robustness of the promising regions, and a dual-mode computational resource allocation component to manage sub-populations by taking several factors, including robustness, into account. Our experimental results demonstrate the superiority of the proposed method over other state-of-the-art approaches.
Danial Yazdani, D. Yazdani, Jürgen Branke, Mohammad Nabi Omidvar, Amir Gandomi, Xin Yao (2022). Robust Optimization Over Time by Estimating Robustness of Promising Regions. IEEE Transactions on Evolutionary Computation, 27(3), pp. 657-670, DOI: 10.1109/tevc.2022.3180590.
Datasets shared by verified academics with rich metadata and previews.
Authors choose access levels; downloads are logged for transparency.
Students and faculty get instant access after verification.
Type
Article
Year
2022
Authors
6
Datasets
0
Total Files
0
Language
English
Journal
IEEE Transactions on Evolutionary Computation
DOI
10.1109/tevc.2022.3180590
Access datasets from 50,000+ researchers worldwide with institutional verification.
Get Free Access