DocumentCode
3399326
Title
Voronoi-based estimation of distribution algorithm for multi-objective optimization
Author
Okabe, Tatsuya ; Jin, Yaochu ; Sendoff, B. ; Olhofer, Markus
Author_Institution
Honda Res. Inst. Eur. GmbH, Offenbach, Germany
Volume
2
fYear
2004
fDate
19-23 June 2004
Firstpage
1594
Abstract
The distribution of the Pareto-optimal solutions often has a clear structure. To adapt evolutionary algorithms to the structure of a multi-objective optimization problem, either an adaptive representation or adaptive genetic operators should be employed. We suggest an estimation of distribution algorithm for solving multi-objective optimization, which is able to adjust its reproduction process to the problem structure. For this purpose, a new algorithm called Voronoi-based estimation of distribution algorithm (VEDA) is proposed. In VEDA, a Voronoi diagram is used to construct stochastic models, based on which new offspring will be generated. Empirical comparisons of the VEDA with other estimation of distribution algorithms (EDAs) and the popular NSGA-II algorithm are carried out. In addition, representation of Pareto-optimal solutions using a mathematical model rather than a solution set is also discussed.
Keywords
Pareto optimisation; computational geometry; estimation theory; evolutionary computation; stochastic processes; NSGA-II algorithm; Pareto-optimal solutions; Voronoi diagram; Voronoi-based estimation of distribution algorithm; adaptive genetic operators; adaptive representation; evolutionary algorithms; mathematical model; multiobjective optimization; stochastic model construction; Design optimization; Electronic design automation and methodology; Europe; Evolutionary computation; Genetic algorithms; Genetic mutations; Mathematical model; Partitioning algorithms; Sampling methods; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2004. CEC2004. Congress on
Print_ISBN
0-7803-8515-2
Type
conf
DOI
10.1109/CEC.2004.1331086
Filename
1331086
Link To Document