IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i23p4459-d984778.html
   My bibliography  Save this article

Dynamic Constrained Boundary Method for Constrained Multi-Objective Optimization

Author

Listed:
  • Qiuzhen Wang

    (Key Laboratory of Intelligent Computing and Information Processing, Ministry of Education, School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411100, China
    Faculty of School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411105, China)

  • Zhibing Liang

    (Key Laboratory of Intelligent Computing and Information Processing, Ministry of Education, School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411100, China
    Faculty of School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411105, China)

  • Juan Zou

    (Key Laboratory of Intelligent Computing and Information Processing, Ministry of Education, School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411100, China
    Faculty of School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411105, China)

  • Xiangdong Yin

    (Faculty of Informational Engineering, Hunan University of Science and Engineering, Yongzhou 411201, China)

  • Yuan Liu

    (Key Laboratory of Intelligent Computing and Information Processing, Ministry of Education, School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411100, China
    Faculty of School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411105, China)

  • Yaru Hu

    (Key Laboratory of Intelligent Computing and Information Processing, Ministry of Education, School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411100, China
    Faculty of School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411105, China)

  • Yizhang Xia

    (Key Laboratory of Intelligent Computing and Information Processing, Ministry of Education, School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411100, China
    Faculty of School of Computer Science and School of Cyberspace Science of Xiangtan University, Xiangtan 411105, China)

Abstract

When solving complex constrained problems, how to efficiently utilize promising infeasible solutions is an essential issue because these promising infeasible solutions can significantly improve the diversity of algorithms. However, most existing constrained multi-objective evolutionary algorithms (CMOEAs) do not fully exploit these promising infeasible solutions. In order to solve this problem, a constrained multi-objective optimization evolutionary algorithm based on the dynamic constraint boundary method is proposed (CDCBM). The proposed algorithm continuously searches for promising infeasible solutions between UPF (the unconstrained Pareto front) and CPF (the constrained Pareto front) during the evolution process by the dynamically changing auxiliary population of the constraint boundary, which continuously provides supplementary evolutionary directions to the main population and improves the convergence and diversity of the main population. Extensive experiments on three well-known test suites and three real-world constrained multi-objective optimization problems demonstrate that CDCBM is more competitive than seven state-of-the-art CMOEAs.

Suggested Citation

  • Qiuzhen Wang & Zhibing Liang & Juan Zou & Xiangdong Yin & Yuan Liu & Yaru Hu & Yizhang Xia, 2022. "Dynamic Constrained Boundary Method for Constrained Multi-Objective Optimization," Mathematics, MDPI, vol. 10(23), pages 1-16, November.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:23:p:4459-:d:984778
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/23/4459/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/23/4459/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:10:y:2022:i:23:p:4459-:d:984778. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.