4.7 Article

Adaptive operator selection with test-and-apply structure for decomposition-based multi-objective optimization

Journal

SWARM AND EVOLUTIONARY COMPUTATION
Volume 68, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.swevo.2021.101013

Keywords

Adaptive operator selection; Multi-objective optimization; Evolutionary algorithm; Credit assignment

Ask authors/readers for more resources

This paper proposes a test-and-apply based adaptive operator selection strategy (TAOS) to improve decomposition-based multi-objective optimization. The strategy achieves a better balance between fairness and exploration-exploitation through the two phases of test and apply, and outperforms existing state of the arts in multi-objective optimization.
In this paper, we propose a test-and-apply based adaptive operator selection strategy (TAOS) towards significant improvement of decomposition-based multi-objective optimization. In this approach, the entire evolutionary process is structured into several continuous sections, each of which is designed to run a test-and-apply procedure, in order to pave the way for adaptive selection of the best possible operators. In the phase of test, the adopted operators are tested by running sequentially on individuals and then the operators credits are assigned by their successful update of counts to replace the parent solutions. In the phase of apply, the best operator is selected to run on the remaining time of this section. In comparison with the existing state of the arts, our introduced two phases with the test-and-apply strategy not only achieve a better fairness, but also a more appropriate balance between exploration and exploitation for the decomposition-based multi-objective evolutionary algorithms, where the decomposition approach is convenient for credit assignment in the test phase. To evaluate our proposed strategy, we have carried out extensive experiments and the results support that our proposed outperforms the existing state of the arts on three sets of multi-objective optimization problems.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available