Output details

Deductive Sort and Climbing Sort: New Methods for Non-Dominated Sorting

<12> This paper describes two new efficient methods for the non-dominated sorting of a set of points/solutions. The proposed algorithms represent entirely lossless methods for computing dominance information within any multi-objective environment (e.g. multi-objective evolutionary algorithms). The computation of dominance is often the most significant contribution to algorithmic complexity in such algorithms and thus the proposed method will increase the performance of ANY multi-objective algorithm (including EAs) to which they are applied within reasonable constraints with respect to the number of objectives and solutions to be sorted. This journal has a five year impact factor of 3.027.