Hongyang Zhang , Shuting Wang , Yuanlong Xie , Hu Li , Shiqi Zheng
{"title":"Leadership succession inspired adaptive operator selection mechanism for multi-objective optimization","authors":"Hongyang Zhang , Shuting Wang , Yuanlong Xie , Hu Li , Shiqi Zheng","doi":"10.1016/j.matcom.2025.01.007","DOIUrl":null,"url":null,"abstract":"<div><div>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 (<em>ECI</em>) 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.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"232 ","pages":"Pages 454-474"},"PeriodicalIF":4.4000,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics and Computers in Simulation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0378475425000072","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
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.
期刊介绍:
The aim of the journal is to provide an international forum for the dissemination of up-to-date information in the fields of the mathematics and computers, in particular (but not exclusively) as they apply to the dynamics of systems, their simulation and scientific computation in general. Published material ranges from short, concise research papers to more general tutorial articles.
Mathematics and Computers in Simulation, published monthly, is the official organ of IMACS, the International Association for Mathematics and Computers in Simulation (Formerly AICA). This Association, founded in 1955 and legally incorporated in 1956 is a member of FIACC (the Five International Associations Coordinating Committee), together with IFIP, IFAV, IFORS and IMEKO.
Topics covered by the journal include mathematical tools in:
•The foundations of systems modelling
•Numerical analysis and the development of algorithms for simulation
They also include considerations about computer hardware for simulation and about special software and compilers.
The journal also publishes articles concerned with specific applications of modelling and simulation in science and engineering, with relevant applied mathematics, the general philosophy of systems simulation, and their impact on disciplinary and interdisciplinary research.
The journal includes a Book Review section -- and a "News on IMACS" section that contains a Calendar of future Conferences/Events and other information about the Association.