IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v328y2026i2p574-590.html
   My bibliography  Save this article

Decision space dynamic niching-based method for constrained multiobjective evolutionary optimization

Author

Listed:
  • Yu, Fan
  • Chen, Qun
  • Zhou, Jinlong

Abstract

Finding a set with a good approximation to the Pareto-optimal solutions in the multiobjective optimization problem (MOP) is a challenging task in terms of convergence toward and diversity across the Pareto optimal front (PoF). In some cases, solving MOPs requires satisfying certain constraints, which significantly increases the complexity of the problem. Such problems are constrained multiobjective optimization problems (CMOPs) and pose considerable computational challenges. Many constrained multiobjective evolutionary algorithms (CMOEAs) face challenges in avoiding becoming trapped in local optima, which impacts convergence, and offer solutions that lack good coverage of the PoF, implying weak diversity. All these nonoptimal or partially optimal solutions in the objective space are essentially clustered in local optimality dilemmas in the decision space. To better eliminate the convergence and diversity challenges caused by clustered solutions, this paper proposes a decision space dynamic niching-based (DSDN) method to better address CMOPs. Specifically, the DSDN method adds a dynamic decision space niche as an additional criterion to the traditional Pareto-constrained dominance principle (Pareto-CDP). The better preserved solutions must satisfy the Pareto-CDP and the condition within the niche radius of other solutions, which strictly meets the original dominance relationship requirement while relaxing the nondominance threshold. As a result, the dynamic adjustment of the niche radius (NR) effectively balances the exploitation and exploration of solutions in the decision space while enhancing both convergence and diversity in the objective space. Experiments conducted on four widely recognized test suites and three real-world case studies have demonstrated that the DSDN method yields significantly better results than the original Pareto-CDP algorithms. Furthermore, the proposed approach is competitive with or comparable to seven other state-of-the-art CMOEAs.

Suggested Citation

  • Yu, Fan & Chen, Qun & Zhou, Jinlong, 2026. "Decision space dynamic niching-based method for constrained multiobjective evolutionary optimization," European Journal of Operational Research, Elsevier, vol. 328(2), pages 574-590.
  • Handle: RePEc:eee:ejores:v:328:y:2026:i:2:p:574-590
    DOI: 10.1016/j.ejor.2025.07.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725005284
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.07.002?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    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:eee:ejores:v:328:y:2026:i:2:p:574-590. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.