期刊
EVOLUTIONARY COMPUTATION
卷 22, 期 1, 页码 47-77出版社
MIT PRESS
DOI: 10.1162/EVCO_a_00104
关键词
Multi-objective particle swarm optimization; decomposition-based evolutionary algorithms; dominance; archiving technique; OMOPSO; MOEA; D
This paper improves a recently developed multi-objective particle swarm optimizer that incorporates dominance with decomposition used in the context of multi-objective optimization. Decomposition simplifies a multi-objective problem (MOP) by transforming it to a set of aggregation problems, whereas dominance plays a major role in building the leaders' archive. introduces a new archiving technique that facilitates attaining better diversity and coverage in both objective and solution spaces. The improved method is evaluated on standard benchmarks including both constrained and unconstrained test problems, by comparing it with three state of the art multi-objective evolutionary algorithms: MOEA/D, OMOPSO, and dMOPSO. The comparison and analysis of the experimental results, supported by statistical tests, indicate that the proposed algorithm is highly competitive, efficient, and applicable to a wide range of multi-objective optimization problems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据