2026-05-31T03:03:39Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/167642026-02-03T11:51:19Zcom_10630_2254col_10630_37959

00925njm 22002777a 4500 dc Luque-Gallego, Mariano author González-Gallardo, Sandra author Ruiz-Mora, Ana Belén author Saborido Infantes, Rubén author 2018-10-30 The convergence and the diversity of the decompositionbased evolutionary algorithm Global WASF-GA (GWASF-GA) relies on a set of weight vectors that determine the search directions for new non-dominated solutions in the objective space. Although using weight vectors whose search directions are widely distributed may lead to a well-diversified approximation of the Pareto front (PF), this may not be enough to obtain a good approximation for complicated PFs (discontinuous, non-convex, etc.). Thus, we propose to dynamically adjust the weight vectors once GWASF-GA has been run for a certain number of generations. This adjustment is aimed at re-calculating some of the weight vectors, so that search directions pointing to overcrowded regions of the PF are redirected toward parts with a lack of solutions that may be hard to be approximated. We test different parameters settings of the dynamic adjustment in optimization problems with three, five, and six objectives, concluding that GWASF-GA performs better when adjusting the weight vectors dynamically than without applying the adjustment. https://hdl.handle.net/10630/16764 Matemáticas An Improvement Study of the Decomposition-based Algorithm Global WASF-GA for Evolutionary Multiobjective Optimization