.png){kind=icon}
Return
MOEA/D: A multiobjective evolutionary algorithm based on decomposition
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2007.892759.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Decomposition is a basic strategy in traditional multiobjective optimization. However, it has not yet been widely used in multiobjective evolutionary optimization. This paper proposes a multiobjective evolutionary algorithm based on decomposition (MOEA/D). It decomposes a multiobjective optimization problem into a number of scalar optimization subproblems and optimizes them simultaneously. Each subproblem is optimized by only using information from its several neighboring subproblems, which makes MOEA/D have lower computational complexity at each generation than MOGLS and nondominated sorting genetic algorithm H (NSGA-II). Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjective optimization problems. It has been shown that MOEA/D using objective normalization can deal with disparately-scaled objectives, and MOEA/D with an advanced decomposition method can generate a set of very evenly distributed solutions for 3-objective test instances. The ability of MOEA/D with small population, the scalability and sensitivity of MOEA/D have also been experimentally investigated in this paper.
Keywords:
computational complexity
decomposition
evolutionary algorithm
multiobjective optimization
Pareto optimality
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
No organization information available
Cited Papers
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSave
ShareSave
Influence of biochar on soil physical and chemical properties and crop yields in rainfed field.png)
IF0
PREAI
ShareSave
View more