Corner sort for pareto-based many-objective optimization

Handing WANG, Xin YAO

Research output: Journal PublicationsJournal Article (refereed)peer-review

117 Citations (Scopus)


Nondominated sorting plays an important role in Pareto-based multiobjective evolutionary algorithms (MOEAs). When faced with many-objective optimization problems multiobjective optimization problems (MOPs) with more than three objectives, the number of comparisons needed in nondominated sorting becomes very large. In view of this, a new corner sort is proposed in this paper. Corner sort first adopts a fast and simple method to obtain a nondominated solution from the corner solutions, and then uses the nondominated solution to ignore the solutions dominated by it to save comparisons. Obtaining the nondominated solutions requires much fewer objective comparisons in corner sort. In order to evaluate its performance, several state-of-the-art nondominated sorts are compared with our corner sort on three kinds of artificial solution sets of MOPs and the solution sets generated from MOEAs on benchmark problems. On one hand, the experiments on artificial solution sets show the performance on the solution sets with different distributions. On the other hand, the experiments on the solution sets generated from MOEAs show the influence that different sorts bring to MOEAs. The results show that corner sort performs well, especially on many-objective optimization problems. Corner sort uses fewer comparisons than others. © 2013 IEEE.
Original languageEnglish
Article number6472282
Pages (from-to)92-102
Number of pages11
JournalIEEE Transactions on Cybernetics
Issue number1
Early online date7 May 2013
Publication statusPublished - Jan 2014
Externally publishedYes


  • Corner sort
  • many-objective optimization
  • nondominated sort
  • Pareto-based multiobjective evolutionary algorithms (MOEA)


Dive into the research topics of 'Corner sort for pareto-based many-objective optimization'. Together they form a unique fingerprint.

Cite this