Very Fast Non-dominated Sorting | Zendy

Czesław Smutnicki | Zendy; Dominik Żelazny | Zendy; Jarosław Rudy | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Very Fast Non-dominated Sorting

Author(s) -

Czesław Smutnicki,

Dominik Żelazny,

Jarosław Rudy

Publication year - 2014

Publication title -

decision making in manufacturing and services

Language(s) - English

Resource type - Journals

eISSN - 2300-7087

pISSN - 1896-8325

DOI - 10.7494/dmms.2014.8.1.13

Subject(s) - speedup , sorting , computer science , mathematical proof , algorithm , sorting algorithm , computational complexity theory , parallel computing , pareto principle , sort , theoretical computer science , mathematical optimization , mathematics , geometry , information retrieval

New and very ecient parallel algorithm for the Fast Non-dominated Sorting of Pareto fronts is proposed. By decreasing its computational complexity, the application of the proposed method allows us to increase the speedup of the best up to now Fast and Elitist Multi-objective Genetic Algorithm (NSGA-II) more than two orders of magnitudes. Formal proofs of time complexities of basic as well as improved versions of the procedure are presented. Provided experimental results fully conrm theoretical ndings.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research