Assessment of Robust Multi-objective Evolutionary Algorithms on Robust and Noisy Environments

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Robust optimization considers uncertainty in the decision variables while noisy optimization concerns with uncertainty in the evaluation of objective and constraint functions. Although many evolutionary algorithms have been proposed to deal with robust or noisy optimization problems, the research question approached here is whether these methods can deal with both types of uncertainties at the same time. In order to answer this question, we extend a test function generator available in the literature for multi-objective optimization to incorporate uncertainties in the decision variables and in the objective functions. It allows the creation of scalable and customizable problems for any number of objectives. Three evolutionary algorithms specifically designed for robust or noisy optimization were selected: RNSGA-II and RMOEA/D, which utilize Monte Carlo sampling, and the C-RMOEA/D, which is a coevolutionary MOEA/D that uses a deterministic robustness measure. We did experiments with these algorithms on multi-objective problems with (i) uncertainty in the decision variables, (ii) noise in the output, and (iii) with both robust and noisy problems. The results show that these algorithms are not able to deal with simultaneous uncertainties (noise and perturbation). Therefore, there is a need for designing algorithms to deal with simultaneously robust and noisy environments.

Cite

CITATION STYLE

APA

de Sousa, M. C., Meneghini, I. R., & Guimarães, F. G. (2023). Assessment of Robust Multi-objective Evolutionary Algorithms on Robust and Noisy Environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14197 LNAI, pp. 33–48). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-45392-2_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free