Issue: 2025/Vol.35/No.2, Pages
FIXEDSUM: A NOVEL ALGORITHM FOR GENERATING WEIGHT VECTORS IN DECOMPOSITION-BASED MULTIOBJECTIVE OPTIMIZATION
Syed Zaffar Qasim
, Muhammad Ali Ismail
This is not yet the definitive version of the paper. This version will undergo additional copyediting, typesetting and review before it is published in its final form, but we are providing this version to give early visibility of the article.
Cite as: S. Z. Qasim, M. A. Ismail. FixedSum: A novel algorithm for generating weight vectors in decomposition-based multiobjective optimization. Operations Research and Decisions 2025: 35(2). DOI 10.37190/ord250204
Abstract
Many multiobjective optimization algorithms employ weight vectors (WVs) for decomposing a problem into multiple subproblems. These weight vectors should be uniformly spread along the Pareto front. In the recent past, some studies about the development of decomposition-based multiobjective evolutionary algorithms have adopted different methods for generating weight vectors. However these WVs are often clustered, either near the boundary or in inner regions of the search space. In this paper, we have proposed a novel algorithm, FixedSum, for generation of arbitrary number of WVs of any user-specified dimension. These weight vectors are more uniformly spread in the search space and we have compared our results with other methods on 5-, 8-, 10- and 12-D weight vectors. For further validation, we have applied our weight vectors along with the WVs of two other methods for solving the DTLZ problems. All the results demonstrate the improved spread ability of our method as compared to competing approaches.
Keywords: Multiple objective programming, weight vectors, many-objective optimization, decomposition-based multiobjective algorithm, FixedSum
Received: 18 April 2024 Accepted: 3 January 2025
Published online: 8 February 2025