Repository logo
Article

Very fast non-dominated sorting

Thumbnail Image
DOI: https://doi.org/10.7494/dmms.2014.8.1.13 

Files

dmms.2014.8.1.13.pdf (367.59 KB)

Date

2014

Presentation Date

Editor

Authors

Other contributors

Access rights

Access: otwarty dostęp
Rights: CC BY-NC 4.0
Attribution-NonCommercial 4.0 International

Attribution-NonCommercial 4.0 International

Other title

Resource type

artykuł

Version

wersja wydawnicza
thumbnail.journal.alt
Item type:Journal Issue,
Decision Making in Manufacturing and Services
2014 - Vol. 8 - No. 1/2

Pagination/Pages:

pp. 13-23

Research Project

Event

Description

Keywords

parallel algorithms, Pareto sorting, computational complexity, GPU computing, multiple-criteria decision analysis, NSGA-II

Abstract

A new and very efficient 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 magnitude. Formal proofs of time complexities of basic as well as improved versions of the procedure are presented. The provided experimental results fully confirm theoretical findings.

Access rights

Access: otwarty dostęp
Rights: CC BY-NC 4.0
Attribution-NonCommercial 4.0 International

Attribution-NonCommercial 4.0 International

URI

https://repo.agh.edu.pl/handle/AGH/44471

Collections

Artykuły (CN-dmms)