Robust Optimization over Time Problems—Characterization and Literature Review
Robust optimization over time (ROOT) is a relatively recent topic in the field of dynamic evolutionary optimization (EDO). The goal of ROOT problems is to find the optimal solution for several environments at the same time. Although significant contributions to ROOT have been published in the past,...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-11-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/12/22/4609 |
| _version_ | 1797459519080497152 |
|---|---|
| author | Pavel Novoa-Hernández Amilkar Puris David A. Pelta |
| author_facet | Pavel Novoa-Hernández Amilkar Puris David A. Pelta |
| author_sort | Pavel Novoa-Hernández |
| collection | DOAJ |
| description | Robust optimization over time (ROOT) is a relatively recent topic in the field of dynamic evolutionary optimization (EDO). The goal of ROOT problems is to find the optimal solution for several environments at the same time. Although significant contributions to ROOT have been published in the past, it is not clear to what extent progress has been made in terms of the type of problem addressed. In particular, we believe that there is confusion regarding what it actually means to solve a ROOT problem. To overcome these limitations, the objective of this paper is twofold. On the one hand, to provide a characterization framework of ROOT problems in terms of their most relevant features, and on the other hand, to organize existing contributions according to it. As a result, from an initial set of 186 studies, the characterization framework was applied to 35 of them, allowing to identification of some important gaps and proposing new research opportunities. We have also experimentally addressed the effect of available information on ROOT problems, concluding that there is indeed a significant impact on the performance of the algorithm and that the proposed classification is appropriate to characterize the complexity of ROOT problems. To help identify further research opportunities, we have implemented an interactive dashboard with the results of the review conducted, which is available online. |
| first_indexed | 2024-03-09T16:52:33Z |
| format | Article |
| id | doaj.art-2a4a5960ff5b44b6a0b74d24fb1b722d |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-09T16:52:33Z |
| publishDate | 2023-11-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-2a4a5960ff5b44b6a0b74d24fb1b722d2023-11-24T14:39:14ZengMDPI AGElectronics2079-92922023-11-011222460910.3390/electronics12224609Robust Optimization over Time Problems—Characterization and Literature ReviewPavel Novoa-Hernández0Amilkar Puris1David A. Pelta2Departamento de Ciencias de la Computación e Inteligencia Artificial, Universidad de Granada, 18071 Granada, SpainFacultad de Ciencias de la Ingeniería, Universidad Técnica Estatal de Quevedo, Quevedo 120550, EcuadorDepartamento de Ciencias de la Computación e Inteligencia Artificial, Universidad de Granada, 18071 Granada, SpainRobust optimization over time (ROOT) is a relatively recent topic in the field of dynamic evolutionary optimization (EDO). The goal of ROOT problems is to find the optimal solution for several environments at the same time. Although significant contributions to ROOT have been published in the past, it is not clear to what extent progress has been made in terms of the type of problem addressed. In particular, we believe that there is confusion regarding what it actually means to solve a ROOT problem. To overcome these limitations, the objective of this paper is twofold. On the one hand, to provide a characterization framework of ROOT problems in terms of their most relevant features, and on the other hand, to organize existing contributions according to it. As a result, from an initial set of 186 studies, the characterization framework was applied to 35 of them, allowing to identification of some important gaps and proposing new research opportunities. We have also experimentally addressed the effect of available information on ROOT problems, concluding that there is indeed a significant impact on the performance of the algorithm and that the proposed classification is appropriate to characterize the complexity of ROOT problems. To help identify further research opportunities, we have implemented an interactive dashboard with the results of the review conducted, which is available online.https://www.mdpi.com/2079-9292/12/22/4609robust optimization over timeliterature reviewdynamic optimization problems |
| spellingShingle | Pavel Novoa-Hernández Amilkar Puris David A. Pelta Robust Optimization over Time Problems—Characterization and Literature Review Electronics robust optimization over time literature review dynamic optimization problems |
| title | Robust Optimization over Time Problems—Characterization and Literature Review |
| title_full | Robust Optimization over Time Problems—Characterization and Literature Review |
| title_fullStr | Robust Optimization over Time Problems—Characterization and Literature Review |
| title_full_unstemmed | Robust Optimization over Time Problems—Characterization and Literature Review |
| title_short | Robust Optimization over Time Problems—Characterization and Literature Review |
| title_sort | robust optimization over time problems characterization and literature review |
| topic | robust optimization over time literature review dynamic optimization problems |
| url | https://www.mdpi.com/2079-9292/12/22/4609 |
| work_keys_str_mv | AT pavelnovoahernandez robustoptimizationovertimeproblemscharacterizationandliteraturereview AT amilkarpuris robustoptimizationovertimeproblemscharacterizationandliteraturereview AT davidapelta robustoptimizationovertimeproblemscharacterizationandliteraturereview |