Constrained multi-objective optimization problems (CMOPs) frequently arise in real-world applications where multiple conflicting objectives must be optimized under complex constraints. Existing dual-population two-stage algorithms have shown promise by leveraging infeasible solutions to improve solution quality. However, designing high-performing constrained multi-objective evolutionary algorithms (CMOEAs) remains a challenging task due to the intricacy of algorithmic components. Meanwhile, large language models (LLMs) offer new opportunities for assisting with algorithm design; however, their effective integration into such tasks remains underexplored. To address this gap, we propose LLM4CMO, a novel CMOEA based on a dual-population, two-stage framework. In Stage 1, the algorithm identifies both the constrained Pareto front (CPF) and the unconstrained Pareto front (UPF). In Stage 2, it performs targeted optimization using a combination of hybrid operators (HOps), an epsilon-based constraint-handling method, and a classification-based UPF-CPF relationship strategy, along with a dynamic resource allocation (DRA) mechanism. To reduce design complexity, the core modules, including HOps, epsilon decay function, and DRA, are decoupled and designed through prompt template engineering and LLM-human interaction. Experimental results on six benchmark test suites and ten real-world CMOPs demonstrate that LLM4CMO outperforms eleven state-of-the-art baseline algorithms. Ablation studies further validate the effectiveness of the LLM-aided modular design. These findings offer preliminary evidence that LLMs can serve as efficient co-designers in the development of complex evolutionary optimization algorithms. The code associated with this article is available at https://anonymous.4open.science/r/LLM4CMO971.
翻译:约束多目标优化问题(CMOPs)在现实应用中频繁出现,其中需要在复杂约束条件下优化多个相互冲突的目标。现有的双种群两阶段算法通过利用不可行解来提高解的质量,已显示出良好的前景。然而,由于算法组件的复杂性,设计高性能的约束多目标进化算法(CMOEAs)仍然是一项具有挑战性的任务。与此同时,大语言模型(LLMs)为辅助算法设计提供了新的机遇,但其在此类任务中的有效整合仍未得到充分探索。为填补这一空白,我们提出了LLM4CMO,一种基于双种群两阶段框架的新型CMOEA。在第一阶段,算法同时识别约束帕累托前沿(CPF)和无约束帕累托前沿(UPF)。在第二阶段,它结合使用混合算子(HOps)、基于epsilon的约束处理方法、基于分类的UPF-CPF关系策略以及动态资源分配(DRA)机制,进行有针对性的优化。为了降低设计复杂性,包括HOps、epsilon衰减函数和DRA在内的核心模块被解耦,并通过提示模板工程和LLM-人类交互进行设计。在六个基准测试套件和十个现实世界CMOPs上的实验结果表明,LLM4CMO优于十一种先进的基线算法。消融研究进一步验证了LLM辅助模块化设计的有效性。这些发现提供了初步证据,表明LLMs可以作为复杂进化优化算法开发过程中的高效协同设计者。本文相关代码可在 https://anonymous.4open.science/r/LLM4CMO971 获取。