期刊名称: |
Information Sciences |
全部作者: |
Yu Chen,Xiufen Zou,Weicheng Xie* |
出版年份: |
2011 |
卷 号: |
181(16) |
期 号: |
|
页 码: |
3336-3355 |
查看全本: |
|
In evolutionary multi-objective optimization (EMO), the convergence to the Pareto set of a
multi-objective optimization problem (MOP) and the diversity of the final approximation
of the Pareto front are two important issues. In the existing definitions and analyses of con-
vergence in multi-objective evolutionary algorithms (MOEAs), convergence with probabil-
ity is easily obtained because diversity is not considered. However, diversity cannot be
guaranteed. By combining the convergence with diversity, this paper presents a new def-
inition for the finite representation of a Pareto set, the B-Pareto set, and a convergence met-
ric for MOEAs. Based on a new archive-updating strategy, the convergence of one such
MOEA to the B-Pareto sets of MOPs is proved. Numerical results show that the obtained
B-Pareto front is uniformly distributed along the Pareto front when, according to the
new definition of convergence, the algorithm is convergent.