1 code implementation • 9 Oct 2023 • Alexandre Mascarenhas, Yuri Lavinas, Claus Aranha
Using this framework, we investigate components that were proposed in several popular DOP algorithms.
no code implementations • 31 Jul 2023 • Yuri Lavinas, Marcelo Ladeira, Gabriela Ochoa, Claus Aranha
In terms of decision space behavior, we see a diverse set of the trajectories of the STNs in the analytical artificial problems.
1 code implementation • 25 Mar 2022 • Yuri Lavinas, Marcelo Ladeira, Gabriela Ochoa, Claus Aranha
This study introduces a new methodology to investigate the effects of the final configuration of an automatically designed algorithm.
1 code implementation • 27 Jan 2022 • Yuri Lavinas, Claus Aranha, Gabriela Ochoa
Understanding the search dynamics of multiobjective evolutionary algorithms (MOEAs) is still an open problem.
1 code implementation • 21 Dec 2021 • Yuri Lavinas, Marcelo Ladeira, Claus Aranha
MOEA/D with Partial Update can mitigate common problems related to population size choice with better convergence speed in most MOPs, as shown by the results of hypervolume and number of unique non-dominated solutions, the anytime performance and Empirical Attainment Function indicates.
1 code implementation • 13 Sep 2021 • Yuri Lavinas, Abe Mitsu Teru, Yuta Kobayashi, Claus Aranha
Thus, our adaptive mechanism mitigates problems related to the choice of the number of weight vectors in MOEA/D, increasing the final performance of MOEA/D by filling empty areas of the objective space while avoiding premature stagnation of the search progress.
1 code implementation • 19 Nov 2020 • Felipe Vaz, Yuri Lavinas, Claus Aranha, Marcelo Ladeira
Finding good solutions for Multi-objective Optimization (MOPs) Problems is considered a hard problem, especially when considering MOPs with constraints.
1 code implementation • 20 Jan 2020 • Yuri Lavinas, Claus Aranha, Marcelo Ladeira, Felipe Campelo
Recent studies on resource allocation suggest that some subproblems are more important than others in the context of the MOEA/D, and that focusing on the most relevant ones can consistently improve the performance of that algorithm.