A fast multi-objective evolutionary algorithm based on a tree structure

doi:10.1016/j.asoc.2009.08.018

A fast multi-objective evolutionary algorithm based on a tree structure

2010-03-01

22

PRE

AI

DOI：10.1016/j.asoc.2009.08.018

原文链接

原文求助

摘要

En 中文

This paper proposes a fast evolutionary algorithm based on a tree structure for multi-objective optimization. The tree structure, named dominating tree (DT), is able to preserve the necessary Pareto dominance relations among individuals effectively, contains the density information implicitly, and reduces the number of comparisons among individuals significantly. The evolutionary algorithm based on dominating tree (DTEA) integrates the convergence strategy and diversity strategy into the DT and employs a DT-based eliminating strategy that realizes elitism and preserves population diversity without extra time and space costs. Numerical experiments show that DTEA is much faster than SPEA2, NSGA-II and an improved version of NSGA-II, while its solution quality is competitive with those of SPEA2 and NSGA-II. Crown Copyright (C) 2009 Published by Elsevier B.V. All rights reserved.

Keyword:

Multi-objective evolutionary algorithm

Pareto dominance

Fitness assignment

Eliminating strategy

A fast multi-objective evolutionary algorithm based on a tree structure

摘要

AI总结

期刊

机构