An efficient batch expensive multi-objective evolutionary algorithm based on Decomposition

This paper proposes a novel surrogate-model-based multi-objective evolutionary algorithm, which is called Multi-objective Bayesian Optimization Algorithm based on Decomposition (MOBO/D). In this algorithm, a multi-objective problem is decomposed into several subproblems which will be solved simultan...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2017 IEEE Congress on Evolutionary Computation (CEC) s. 1343 - 1349
Hlavní autori:	Xi Lin, Qingfu Zhang, Sam Kwong
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.06.2017
Predmet:	Algorithm design and analysis Bayes methods Computational modeling Gaussian processes Kernel Lead Optimization
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	This paper proposes a novel surrogate-model-based multi-objective evolutionary algorithm, which is called Multi-objective Bayesian Optimization Algorithm based on Decomposition (MOBO/D). In this algorithm, a multi-objective problem is decomposed into several subproblems which will be solved simultaneously. MOBO/D builds Gaussian process model for each objective to learn the optimization surface, and defines utility function for each subproblem to guide the searching process. At each generation, MOEA/D algorithm is called to locate a set of candidate solutions which maximize all utility functions respectively, and a subset of those candidate solutions is selected for parallel batch evaluation. Experimental study on different test instances validates that MOBO/D can efficiently solve expensive multi-objective problems in parallel. The performance of MOBO/D is also better than several classical expensive optimization methods.
DOI:	10.1109/CEC.2017.7969460