IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v16y2025i1p1-29.html

Correlation-Strength-Driven Self-Adaptive Strategy Adjustment Algorithm for Constrained Optimization

Author

Listed:
  • Yinghan Hong

    (Guangzhou Maritime University, China)

  • Sirui Liang

    (Hanshan Normal University, China)

  • Guizhen Mai

    (Guangzhou Maritime University, China)

  • Yueting Xu

    (South China Agricultural University, China)

  • Han Huang

    (South China University of Technology, China)

  • Jiahao Lian

    (Guangdong University of Technology, China)

  • Wei He

    (Guangzhou Maritime University, China)

  • Dan Xiang

    (Guangzhou Maritime University, China)

  • YuLin Li

    (Guangdong University of Technology, China)

  • Pinghua Chen

    (Guangdong University of Technology, China)

Abstract

Constrained optimization problems involve the simultaneous optimization of objectives and satisfaction of complex constraints, presenting a significant challenge for their solution using evolutionary algorithms (EAs). Compared with traditional EAs using dynamic allocation mechanisms, the authors propose the correlation-strength-driven self-adaptive-strategy adjustment (CSA) algorithm. It quantifies dynamic objective-constraint correlations into a strength coefficient to select constraint or objective priority criteria as initial optimization and adjusts priorities in real time based on feasible solution ratios and optimal objective changes, enabling intelligent strategy switching without manual intervention. The study shows that dynamically balancing priorities between objective improvement and constraint violation reduction enhances allocation efficiency and solution quality. Experiments on CEC2006, CEC2010, and CEC2017 datasets confirm CSA's faster convergence and higher-quality solutions.

Suggested Citation

  • Yinghan Hong & Sirui Liang & Guizhen Mai & Yueting Xu & Han Huang & Jiahao Lian & Wei He & Dan Xiang & YuLin Li & Pinghua Chen, 2025. "Correlation-Strength-Driven Self-Adaptive Strategy Adjustment Algorithm for Constrained Optimization," International Journal of Swarm Intelligence Research (IJSIR), IGI Global Scientific Publishing, vol. 16(1), pages 1-29, January.
    • Handle: RePEc:igg:jsir00:v:16:y:2025:i:1:p:1-29
    as

    Download full text from publisher

    File URL: https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.392504
    Download Restriction: no
    ---><---

    More about this item

    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:igg:jsir00:v:16:y:2025:i:1:p:1-29. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.