Abstract
Multi-task optimization (MTO) is related to the problem of simultaneous optimization of multiple optimization problems, for the purpose of solving these problems better in terms of optimization accuracy or time cost. To handle MTO problems, there emerges many evolutionary MTO (EMTO) algorithms, which possess distinguished strategies or frameworks in the aspect of handling the knowledge transfer between different optimization problems (tasks). In this paper, we explore the possibility of developing a more efficient EMTO solver based on differential evolution by introducing the strategies of a self-adaptive multi-task particle swarm optimization (SaMTPSO) algorithm, and by developing a new knowledge incorporation strategy. Then, we try to apply the proposed algorithm to solve the weapon–target assignment problem, which has never been explored in the field of EMTO before. Experiments were conducted on a popular MTO test benchmark and a WTA-MTO test set. Experimental results show that knowledge transfer in the proposed algorithm is effective and efficient, and EMTO is promising in solving WTA problems.
Highlights
Multi-task optimization (MTO) [1,2] studies the simultaneous optimization of multiple optimization problems, for the purpose of achieving higher optimization performance on each optimization problem, especially when compared to traditional optimization methodologies
To solve MTO problems, researchers have explored many optimization techniques over the years, including the works based on Bayesian optimization and the works based on evolutionary algorithms
This paper explores the possibility of further improving the optimization efficiency of weapon–target assignment (WTA) problems via the evolutionary MTO (EMTO) techniques
Summary
Multi-task optimization (MTO) [1,2] studies the simultaneous optimization of multiple optimization problems, for the purpose of achieving higher optimization performance on each optimization problem, especially when compared to traditional optimization methodologies. Many works have been performed, such as research using evolutionary algorithms [14,15] or research using exact algorithms [16,17]; the WTA problem, known as an NP-complete problem, is difficult to solve, especially when the number of targets or weapons becomes larger and larger. To this end, this paper explores the possibility of further improving the optimization efficiency of WTA problems via the EMTO techniques. Some conclusions on this paper are detailed along with some possible future works
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.