articleIEEE Transactions on Evolutionary ComputationNov 29, 2007Closed access

MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition

University of Essex

Indexed incrossref

Abstract

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 II (NSGA-II). Experimental results have demonstrated that MOEA/D with simple decomposition methods…

Citation impact

9,477
total citations
FWCI
46.36
Percentile
100%
References
47
Citations per year

Authors

2

Topics & keywords

Keywords
  • Multi-objective optimization
  • Evolutionary algorithm
  • Sorting
  • Knapsack problem
  • Mathematical optimization
  • Decomposition
  • Optimization problem
  • Computer science
No related works found for this paper.

Funding