The algorithmsbased on decomposition are regarded as a promising optimizer for the multi-objective optimization problems (MOPs). However, it is difficult for the algorithmsbased on decomposition to handle MOPs with ...
详细信息
ISBN:
(纸本)9781450376914
The algorithmsbased on decomposition are regarded as a promising optimizer for the multi-objective optimization problems (MOPs). However, it is difficult for the algorithmsbased on decomposition to handle MOPs with the complicated feature, because they adopt the fixed weight vectors. In this paper, we propose an adaptive method with the region detection strategy for the decomposition-basedevolutionary algorithm (aMOEA/D-RD) to adjust the weight vectors. In the proposed algorithm, some useless weight vectors, which are not associated to any solution in the successive generations, are found through the region detection method. Then these weight vectors are adaptively adjusted by the solutions in the most crowed subregion. After the adjustment of weight vectors, the distribution of the weight vectors can be more suit to approximate the true the Pareto optimal front of MOPs. Comparative experiments on benchmark with various geometric features have been performed and the simulation results show the effectiveness and the competitiveness of our proposal algorithm.
Semantic diversity in Genetic Programming has proved to be highly beneficial in evolutionary search. We have witnessed a surge in the number of scientific works in the area, starting first in discrete spaces and movin...
详细信息
ISBN:
(纸本)9781728183923
Semantic diversity in Genetic Programming has proved to be highly beneficial in evolutionary search. We have witnessed a surge in the number of scientific works in the area, starting first in discrete spaces and moving then to continuous spaces. The vast majority of these works, however, have focused their attention on single-objective genetic programming paradigms, with a few exceptions focusing on evolutionarymulti-objective Optimization (EMO). The latter works have used well-known robust algorithms, including the Non-dominated Sorting Genetic Algorithm II and the Strength Pareto evolutionary Algorithm, both heavily influenced by the notion of Pareto dominance. These inspiring works led us to make a step forward in EMO by considering multi-objective evolutionary algorithms based on decomposition (MOEA/D). We show, for the first time, how we can naturally promote semantic diversity in MOEA/D in Genetic Programming.
暂无评论