Enhanced decomposition-based many-objective optimization using supplemental weight vectors
Hiroyuki Satō, Satoshi Nakagawa, Minami Miyakawa, Keiki Takadama · 2016
In evolutionary multi-objective optimization, each solution in the population generally has two roles. The first one is to approximate a part of the Pareto front, and the second one is to be a variable information resource to generate offspring. In many-objective optimization involving four or more conflicting objectives, solutions in the population have to be sparsely distributed in the objective space and the variable space to approximate a high-dimensional Pareto front, and each solution faces the difficulty to play the second role since variables are drastically individualized in the population. To overcome this problem, we focus on MOEA/D algorithm framework and propose a method to introduce supplemental weight vectors and solutions which maintain variable information resource to enhance the solution search for each part of the Pareto front. Experimental results using many-objective knapsack problems show that the supplemental weight vectors and solutions improves the search performance of MOEA/D by improving the diversity of the obtained solutions.