IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v232y2025icp454-474.html
   My bibliography  Save this article

Leadership succession inspired adaptive operator selection mechanism for multi-objective optimization

Author

Listed:
  • Zhang, Hongyang
  • Wang, Shuting
  • Xie, Yuanlong
  • Li, Hu
  • Zheng, Shiqi

Abstract

Dynamic selection of representative operators shows great promise for multi-objective optimization, but existing methods suffer from difficulties in balancing fair comparison of operators with dynamic adaptation of evolutionary states, and inaccurate evaluation of operator quality. This paper proposes a leadership succession inspired adaptive operator selection mechanism (LS-AOS), aiming to enhance dynamic matching with time-varying evolutionary states while ensuring fair operator comparisons. In LS-AOS, a new campaign-incumbency rule is designed to be implemented iteratively to allow operators to undergo a fair campaign process, thus identifying optimal operators for generating offspring. Additionally, a two-layer oversight strategy is proposed to make real-time adjustments to operator selection and pool configuration based on operator performance and evolutionary state, with the aim of satisfying the diverse requirements for exploration and exploitation during the evolutionary process. To refine and improve the evaluation of operator quality, the novel Election Campaign Indicator (ECI) is designed that uniquely integrates measures of population diversity and convergence, and effectively extends the applicability of LS-AOS. The experimental results on 23 test problems indicate that LS-AOS possesses feasibility and can effectively improve the performance of benchmark algorithms. Compared with the existing state-of-the-art algorithms, the proposed LS-AOS exhibits sufficient competitiveness and advancement.

Suggested Citation

  • Zhang, Hongyang & Wang, Shuting & Xie, Yuanlong & Li, Hu & Zheng, Shiqi, 2025. "Leadership succession inspired adaptive operator selection mechanism for multi-objective optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 232(C), pages 454-474.
  • Handle: RePEc:eee:matcom:v:232:y:2025:i:c:p:454-474
    DOI: 10.1016/j.matcom.2025.01.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425000072
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2025.01.007?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:matcom:v:232:y:2025:i:c:p:454-474. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.