IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v243y2026icp196-220.html

Dual-population two-archive evolutionary framework for constrained multi-objective optimization

Author

Listed:
  • Chen, Miao
  • Zhao, Shijie
  • Zhang, Tianran
  • Yu, Xin

Abstract

Constrained multi-objective optimization problems (CMOPs) constitute a prevalent and ubiquitous class of optimization challenges that are frequently encountered across diverse field within science and engineering. To solve the complementary multi-objective optimization problem with narrow and disconnected feasible regions, dual-population two-archive evolutionary framework for constrained multi-objective optimization with constrained-archive solution phase-transition and auxiliary-population environment selection pause-termination (CAE_2SP) is proposed. The algorithm uses dual-population with different efficacy and two archives with different functions. To improve the problem of lower population diversity, constrained-archive solution phase-transition strategy is proposed. In this strategy, the diversity of solutions is emphasized in the early generation, so the non-dominated infeasible solutions generated by the evolution of main population are stored in the archive. In the late generation, the feasibility of solutions is taken into account, hence, constrained archive is transformed into storing non-dominated feasible solutions. In addition, this paper puts forward auxiliary-population environment selection pause-termination strategy. In this strategy, auxiliary population stop updating in the late generation and uses the optimal population information in the early generation to guide the evolution, to reduce the consumption of computing resources in the late generation and provide more computing resources for main population to help it search for potential feasible regions. The experimental results of nine comparison algorithms in three benchmark function suites demonstrate that CAE_2SP has superior performance in solving CMOPs compared with others. To validate the applicability of the proposed algorithm in solving practical problems, six real-world problems are employed for testing. The experimental results demonstrate that CAE_2SP exhibits competitive performance in addressing practical issues.

Suggested Citation

  • Chen, Miao & Zhao, Shijie & Zhang, Tianran & Yu, Xin, 2026. "Dual-population two-archive evolutionary framework for constrained multi-objective optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 243(C), pages 196-220.
  • Handle: RePEc:eee:matcom:v:243:y:2026:i:c:p:196-220
    DOI: 10.1016/j.matcom.2025.11.019
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.matcom.2025.11.019?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:matcom:v:243:y:2026:i:c:p:196-220. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.