一种基于杂草克隆的多目标粒子群算法

Abstract

多目标粒子群算法(MOPSO)在优化函数时,尤其对于Pareto前沿是分段不连续的优化函数,存在收敛速度慢,种群多样性差的缺陷。针对此问题,将杂草克隆机制引入MOPSO,提出了一种新的多目标粒子群算法,称之为IWMOPSO。该算法利用改进的档案维护策略和不可行解增强多样性和均匀性,通过标准测试函数验证,能够使所求得的Pareto最优解逼近整个Pareto真实前沿,收敛性和多样性明显优于MOPSO和NSGA-Ⅱ,具有较强的应用性。

When the existing MOPSO algorithm is applied to optimizing the functions with the discontinuous Pareto front, its convergence and the diversity of its population are poor. To solve the problem, we propose our new IW-MOPSO (Invasive Weed MOPSO) algorithm, which we believe is more efficient than existing ones. Sections 1 through 2 of the full paper explain our new IWMOPSO algorithm. Section 1 presents the defects of the MOPSO algorithm. Section 2 explains how to reduce such defects to a minimum. Section 3 uses five benchmark test functions to compare the performance of our new IWMOPSO algorithm with those of the existing MOPSO and NSGA-II algorithms. The test results, given in Tables 1 and 2 and Fig. 7, and their analysis show preliminarily that both the convergence of our IWMOPSO algorithm and its diversity are enhanced by the improved file maintenance strategy and the unfeasible solutions, with the Pareto front obtained with our new algorithm very close to the real Pareto front, thus being more efficient than both the MOPSO and NSGA-II algorithms.