Enhancing diversity for average ranking method in evolutionary many-objective optimization

Authors:
Miqing Li;Jinhua Zheng;Ke Li;Qizhao Yuan;Ruimin Shen
Affiliations:
Institute of Information Engineering, Xiangtan University, Hunan, China;Institute of Information Engineering, Xiangtan University, Hunan, China;Institute of Information Engineering, Xiangtan University, Hunan, China;Institute of Information Engineering, Xiangtan University, Hunan, China;Institute of Information Engineering, Xiangtan University, Hunan, China
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Year:
2010

Citing 6
Cited 0

Techniques for highly multiobjective optimisation: some nondominated points are better than others

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Conflict, harmony, and independence: relationships in evolutionary multi-criterion optimisation

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Pareto-, aggregation-, and indicator-based methods in many-objective optimization

EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
Properties of an adaptive archiving algorithm for storing nondominated vectors

IEEE Transactions on Evolutionary Computation
An Investigation on Noisy Environments in Evolutionary Multiobjective Optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The average ranking (AR) method has been shown highly effective to provide sufficient selection pressure searching towards Pareto optimal set in many-objective optimization. However, as lack of diversity maintenance mechanism, the obtained final set may only concentrate in a subregion of Pareto front. In this paper, we propose a diversity maintenance strategy for AR to balance convergence and diversity during evolution process. We employ grid to define an adaptive neighborhood for each individual, whose size varies with the number of objectives. Moreover, a layering selection scheme integrates it and AR to pick out well-converged individuals and prohibit or postpone the archive of adjacent individuals. From an extensive comparative study with original AR and two other diversity maintenance methods, the proposed method shows a good balance among convergence, uniformity and spread.