Author
Listed:
- Yang Luo
(South China Normal University, China)
- Sirui Liang
(Hanshan Normal University, China)
- Yinghan Hong
(Guangzhou Maritime University, China)
- Jiahao Lian
(Guangdong University of Technology, China)
- Guizhen Mai
(Guangzhou Maritime University, China)
- Cai Guo
(Hanshan Normal University, China)
- Qiyuan Wu
(Guangzhou Maritime University, China)
Abstract
Constrained optimization problems are widely prevalent, with evolutionary algorithms serving as predominant solution approaches. However, these algorithms exhibit inadequate adaptability and lack causal interpretability due to excessive dependence on predefined heuristic rules. This paper proposes an evolutionary constrained optimization framework driven by doubly robust causal learning, which quantifies the causal interaction between objective optimization and constraint satisfaction through the use of causal random forests, and designs a dynamic adaptive strategy-switching mechanism to autonomously select constraint priority, objective priority, and their corresponding complete comparison strategies. Comprehensive experiments conducted on mainstream benchmark suites demonstrate that the proposed framework outperforms state-of-the-art algorithms in convergence speed, solution quality, and stability, while exhibiting enhanced robustness in high-dimensional and strongly constrained scenarios.
Suggested Citation
Yang Luo & Sirui Liang & Yinghan Hong & Jiahao Lian & Guizhen Mai & Cai Guo & Qiyuan Wu, 2026.
"Doubly Robust Causal Learning-Driven Adaptive Evolutionary Constrained Optimization Algorithm,"
International Journal of Swarm Intelligence Research (IJSIR), IGI Global Scientific Publishing, vol. 17(1), pages 1-28, January.
Handle:
RePEc:igg:jsir00:v:17:y:2026:i:1:p:1-28
Download full text from publisher
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:17:y:2026:i:1:p:1-28. 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.