Scholarlink

To handle constrained multi-objective optimization problems (CMOPs), many constrained multi-objective evolutionary algorithms (CMOEAs) have been proposed. However, a recent study has shown that many of these CMOEAs do not perform well on real-world CMOPs. In contrast, NSGA-II, proposed over 20 years ago with a simple constrained dominance principle, has demonstrated better performance than recent CMOEAs on many real-world CMOPs. Motivated by NSGA-II’s promising results, this paper aims to further enhance its performance. We explore the idea of enhancing NSGA-II with a knee point for solving CMOPs. Specifically, a knee point is identified using the minimum distance from the estimated ideal point, and always included in the next population of NSGA-II. Experimental results show that this simple idea improves the performance of NSGA-II on real-world CMOPs.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Enhancing NSGA-II with a Knee Point for Constrained Multi-objective Optimization

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Lie Meng Pang,
  • Hisao Ishibuchi,
  • Yang Nan

摘要

To handle constrained multi-objective optimization problems (CMOPs), many constrained multi-objective evolutionary algorithms (CMOEAs) have been proposed. However, a recent study has shown that many of these CMOEAs do not perform well on real-world CMOPs. In contrast, NSGA-II, proposed over 20 years ago with a simple constrained dominance principle, has demonstrated better performance than recent CMOEAs on many real-world CMOPs. Motivated by NSGA-II’s promising results, this paper aims to further enhance its performance. We explore the idea of enhancing NSGA-II with a knee point for solving CMOPs. Specifically, a knee point is identified using the minimum distance from the estimated ideal point, and always included in the next population of NSGA-II. Experimental results show that this simple idea improves the performance of NSGA-II on real-world CMOPs.