Abstract

Recently, MOEA/D (multi-objective evolutionary algorithm based on decomposition) has achieved great success in the field of evolutionary multi-objective optimization and has attracted a lot of attention. It decomposes a multi-objective optimization problem (MOP) into a set of scalar subproblems using uniformly distributed aggregation weight vectors and provides an excellent general algorithmic framework of evolutionary multi-objective optimization. Generally, the uniformity of weight vectors in MOEA/D can ensure the diversity of the Pareto optimal solutions, however, it cannot work as well when the target MOP has a complex Pareto front (PF; i.e., discontinuous PF or PF with sharp peak or low tail). To remedy…

Citation impact

679
total citations
FWCI
24.58
Percentile
100%
References
67
Citations per year

Authors

6

Topics & keywords

Keywords
  • Mathematical optimization
  • Initialization
  • Evolutionary algorithm
  • Weight
  • Multi-objective optimization
  • Mathematics
  • Decomposition
  • Optimization problem
No related works found for this paper.