Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU

Evolutionary multi-objective optimization algorithms aim at finding an approximation of the Pareto set. For hard to solve problems with many conflicting objectives, the number of functions evaluations to represent the Pareto front can be large and time consuming. Parallel computing can reduce the wa...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization 2017-11, Vol.69 (3), p.607-627
Hauptverfasser:	Ortega, G., Filatovas, E., Garzón, E. M., Casado, L. G.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Central processing units Classification Computer Science Computing time CPUs Evolutionary algorithms Genetic algorithms Graphics processing units Mathematical optimization Mathematics Mathematics and Statistics Multiple objective analysis Operations Research/Decision Theory Optimization Parallel processing Pareto optimization Pareto optimum Real Functions Sorting algorithms
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!