IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v35y2025i2p93-119id4.html
   My bibliography  Save this article

FixedSum: A novel algorithm for generating weight vectors in decomposition-based multiobjective optimization

Author

Listed:
  • Syed Zaffar Qasim

  • Muhammad Ali Ismail

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. Recently, 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 the generation of an 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 5D, 8D, 10D and 12D 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 spreadability of our method compared to competing approaches.

Suggested Citation

  • Syed Zaffar Qasim & Muhammad Ali Ismail, 2025. "FixedSum: A novel algorithm for generating weight vectors in decomposition-based multiobjective optimization," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 35(2), pages 93-119.
    • Handle: RePEc:wut:journl:v:35:y:2025:i:2:p:93-119:id:4
    DOI: 10.37190/ord250204
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/ord2025vol35no2_4.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.37190/ord250204?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wut:journl:v:35:y:2025:i:2:p:93-119:id:4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.