A surrogate-assisted evolutionary algorithm with hypervolume triggered fidelity adjustment for noisy multiobjective integer programming

Although surrogate-assisted evolutionary algorithms (SAEAs) have been widely developed to address computationally expensive multi-objective optimization problems (MOPs), they still encounter difficulties in solving the expensive and noisy combinatorial MOPs. To this end, we propose a novel SAEA to h...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Applied soft computing Ročník 126; s. 109263
Hlavní autori:	Liu, Shulei, Wang, Handing, Yao, Wen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.09.2022
Predmet:	Fidelity adjustment strategy Multi-fidelity optimization Noisy multiobjective integer programming Surrogate-assisted evolutionary algorithm Surrogate-assisted evolutionary algorithm Multi-fidelity optimization Fidelity adjustment strategy Noisy multiobjective integer programming
ISSN:	1568-4946, 1872-9681
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	Although surrogate-assisted evolutionary algorithms (SAEAs) have been widely developed to address computationally expensive multi-objective optimization problems (MOPs), they still encounter difficulties in solving the expensive and noisy combinatorial MOPs. To this end, we propose a novel SAEA to handle this kind of problem. In the proposed algorithm, the averaging method is used to denoise. To balance the conflict between the time cost and the effect of noises, multi-fidelity surrogate models are constructed according to the averaged evaluation results. The number of independent repeated evaluations represents the fidelity level of surrogate models. In the optimization process, the hypervolume indicator is employed as a trigger to determine whether the fidelity level should be increased. In addition, a lightweight local search method, the semi-variable neighborhood search, is proposed to improve the global search efficiency of the proposed algorithm in discrete decision spaces. Experimental results show that our proposed algorithm achieves competitive performance on most benchmark problems.
ISSN:	1568-4946 1872-9681
DOI:	10.1016/j.asoc.2022.109263