A K-Nearest-Neighbors Pareto Rank Assignment Strategy and Compound Crossover Operator Based NSGA-II and Its Applications on Multi-objective Optimization Functions

  • Authors:
  • Weiya Guo;Zhenhua Li;Dan Zhao;Tim Wong

  • Affiliations:
  • China University Of Geosciences,;China University Of Geosciences,;China University Of Geosciences,;China University Of Geosciences,

  • Venue:
  • ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We try to improve the NSGA-II, one of the most classical MOP algorithms, in two ways. To measure individual crowding distance by edge weight of minimum spanning tree and k-nearest-neighbors Pareto rank assignment strategy is helpful on diversity of population; A compound crossover operator increases the extent and the ability of search. Experimental results on ZDTs and DTLZs, suggest that A K-Nearest-Neighbors Pareto Rank Assignment Strategy and Compound Crossover Operator Based NSGA-II (KC NSGA-II) works faster and has more diverse solutions than its origins.