IDEAS home Printed from https://ideas.repec.org/a/ids/ijcast/v1y2025i3p253-280.html
   My bibliography  Save this article

A constrained multi-objective evolutionary algorithm based on dynamic clustering strategy

Author

Listed:
  • Jiwei Tu
  • Hong Li
  • Yuanlong Hu
  • Shaojin Geng
  • Dongyang Li
  • Lei Wang

Abstract

The dual-population co-evolution strategy is a class of methods that can efficiently solve constrained multi-objective optimisation problems. However, the auxiliary population does not contribute effective individuals to the main population at all stages of population evolution. Considering the utilisation of auxiliary population at later evolutionary stage, a constrained multi-objective evolutionary algorithm based on the dynamic clustering co-evolutionary strategy is proposed. This paper proposes a dynamic clustering strategy that dynamically divides the population into active and inactive populations based on the auxiliary population status, where only the active population participates in generating the offspring, so as to reasonably allocate the computational resources and enhance the convergence of the population. In addition, the feasible solutions found by the auxiliary population are retained using an additional archived population to improve the diversity of the main population. Experimental results demonstrate the effectiveness of the algorithm.

Suggested Citation

  • Jiwei Tu & Hong Li & Yuanlong Hu & Shaojin Geng & Dongyang Li & Lei Wang, 2025. "A constrained multi-objective evolutionary algorithm based on dynamic clustering strategy," International Journal of Complexity in Applied Science and Technology, Inderscience Enterprises Ltd, vol. 1(3), pages 253-280.
  • Handle: RePEc:ids:ijcast:v:1:y:2025:i:3:p:253-280
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=145832
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijcast:v:1:y:2025:i:3:p:253-280. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=71 .

    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.