A Self-Adaptive Evolutionary Multi-Task Based Constrained Multi-Objective Evolutionary Algorithm

Constrained multi-objective optimization problems (CMOPs) are difficult to solve since they involve the optimization of multiple objectives and the satisfaction of various constraints. Most constrained multi-objective evolutionary algorithms (CMOEAs) are prone to fall into the local optima due to the imbalance between objectives and constraints as well as the poor search ability of the population. To better solve CMOPs, this paper proposes a double-balanced evolutionary multi-task optimization (DBEMTO) algorithm, which evolves two populations to respectively solve the main task (CMOP) and the auxiliary task (MOP extracted from the CMOP). In DBEMTO, three evolutionary strategies are assigned to each population for offspring generation. The three evolutionary strategies include an individual transfer-based inter-task strategy and two intra-task strategies, not only utilizing the information of inter-task but also providing diverse search abilities of intra-task. Moreover, a self-adaptive scheme is developed to self-adaptively employ three strategies, so that the population can balance the information utilization of both intra-task and inter-task. Then, in the environmental selection, the performance of the three strategies is adopted to guide the sharing of the two offspring populations. Compared with several other state-of-the-art CMOEAs, DBEMTO has performed more competitively according to the final results.

Automated summary

This paper proposes a double-balanced evolutionary multi-task optimization (DBEMTO) algorithm to better solve constrained multi-objective optimization problems (CMOPs). DBEMTO evolves two populations to solve the main task (CMOP) and the auxiliary task (MOP extracted from the CMOP) respectively and uses three evolutionary strategies for offspring generation. DBEMTO has performed more competitively compared to other state-of-the-art CMOEAs according to the final results.