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

Angle-Based Dual-Association Evolutionary Algorithm for Many-Objective Optimization

Author

Listed:
  • Xinzi Wang

    (Faculty of Humanities and Arts, Macau University of Science and Technology, Macao 999078, China)

  • Huimin Wang

    (Management School, The University of Sheffield, Sheffield S10 2TG, UK)

  • Zhen Tian

    (James Watt School of Engineering, University of Glasgow, Glasgow G12 8QQ, UK)

  • Wenxiao Wang

    (Faculty of Humanities and Arts, Macau University of Science and Technology, Macao 999078, China)

  • Junming Chen

    (Faculty of Humanities and Arts, Macau University of Science and Technology, Macao 999078, China)

Abstract

As the number of objectives increases, the comprehensive processing performance of multi-objective optimization problems significantly declines. To address this challenge, this paper proposes an Angle-based dual-association Evolutionary Algorithm for Many-Objective Optimization (MOEA-AD). The algorithm enhances the exploration capability of unknown regions by associating empty subspaces with the solutions of the highest fitness through an angle-based bi-association strategy. Additionally, a novel quality assessment scheme is designed to evaluate the convergence and diversity of solutions, introducing dynamic penalty coefficients to balance the relationship between the two. Adaptive hierarchical sorting of solutions is performed based on the global diversity distribution to ensure the selection of optimal solutions. The performance of MOEA-AD is validated on several classic benchmark problems (with up to 20 objectives) and compared with five state-of-the-art multi-objective evolutionary algorithms. Experimental results demonstrate that the algorithm exhibits significant advantages in both convergence and diversity.

Suggested Citation

  • Xinzi Wang & Huimin Wang & Zhen Tian & Wenxiao Wang & Junming Chen, 2025. "Angle-Based Dual-Association Evolutionary Algorithm for Many-Objective Optimization," Mathematics, MDPI, vol. 13(11), pages 1-21, May.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:11:p:1757-:d:1664435
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/11/1757/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/11/1757/
    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:13:y:2025:i:11:p:1757-:d:1664435. 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.