空间科学与技术学院学术2015年论文集-西安电子科技大学.docVIP

A Decomposition Based Multi-objective Particle Swarm Optimizer for Constraint Handling Weikang Ning, Baolong Guo, Yunyi Yan, Jinfu Wu, Dan Zhao (School of Aerospace Science Technology, XidianUniv., Xi’an 710071, China;) Abstract: Multi-objective particle swarm optimization (MOPSO) algorithms based on decomposition have drawn a lot attention recently. Despite the success of decomposition based MOPSO (MOPSO/D) algorithms, its use in constrained multi-objective optimization problems (CMOPs) remains to be further studied. Most MOPSO/D algorithms proposed recently are designed for unconstrained problems. Thus we aim to extend the ability of MOPSO/D algorithms in our study. A framework of decomposition based MOPSO for constraint handling (cMOPSO/D) is first proposed in this paper. Then two typical constraint handling techniques are combined with cMOPSO/D as a comparison, which results in two versions of cMOPSO/D: cMOPSO/D using penalty function (cMOPSO/D-P) and cMOPSO/D using lexicographic ordering (cMOPSO/D-LO). The algorithms proposed are tested on ten CMOPs and are compared with three state-of-the-art algorithms, cMOEA/D, D2MOPSO and OMOPSO. Experimental results supported by the statistical analysis of three quantitative metrics, together with some theoretical analysis, suggest that the proposed algorithms are effective, competitive and promising. Keywords: Multi-objective optimization, Decomposition, PSO, Constraint handling, Penalty function, Lexicographic ordering Introduction As a paradigm of evolutionary algorithm (EA), particle swarm optimization (PSO) has been successfully applied to solving multi-objective optimization problems (MOPs)[22,20,11]. In the real world, however, many problems to be solved often need to satisfy several equality and/or inequality constraints, and this presents an additional challenge for multi-objective evolutionary algorithms (MOEAs). Solving constrained multi-objective problems (CMOPs) ideally often requires the search making a bala