Abstract
Current years have witnessed an increment in the number of research activities on improving the efficacy of multitasking algorithms for tackling challenging optimization problems. However, current approaches often present two potential problems. Firstly, although tasks may have different characteristics, existing literature usually utilizes only one search operator for all of them. Secondly, while multitasking environments comprise tasks of varying difficulty, previous proposals treat them equally. This paper proposes an algorithm named Ensemble Multifactorial Evolution with Biased Skill Factor Inheritance (EME-BI) for optimizing a large number of tasks simultaneously. In EME-BI, an effective parameter adaptation based on the knowledge transfer quality with Biased Skill-Factor Inheritance mechanism is designed to minimize negative transfer and allocate generated offspring to tasks that need resources. Besides, instead of using only one fixed search operator, EME-BI can automatically select the most appropriate one for each task at each evolutionary stage. Finally, the proposed algorithm is armed with a dynamically adjusted population size to promote exploitation. Empirical studies on various many-task benchmark problems and a real-world problem are conducted to verify the efficiency of EME-BI. The results portrayed that EME-BI achieves highly competitive performance compared to several state-of-the-art algorithms regarding the solution quality, convergence trend, and computation time. This proposal also won first prize at the CEC2021 Competition on Evolutionary Multi-task Optimization, Multi-task single-objective optimization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.