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

DOI10.1007/S10898-016-0468-7zbMath1382.90099OpenAlexW2523557917MaRDI QIDQ1683325

Ernestas Filatovas, Gloria Ortega, E. M. Garzón, Leocadio G. Casado

Publication date: 7 December 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-016-0468-7

zbMATH Keywords

multi-objective optimizationevolutionary algorithmshigh performance computingNSGA-IIGPU computingnon-dominated sorting

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

A parallel naive approach for non-dominated sorting: a theoretical study considering PRAM CREW model ⋮ A reference point-based evolutionary algorithm for approximating regions of interest in multiobjective problems ⋮ Multi-Objective Evolutionary Algorithms: Past, Present, and Future ⋮ Improving the performance and energy of non-dominated sorting for evolutionary multiobjective optimization on GPU/CPU platforms

Uses Software

• Matlab
• CUDA
• MOEA/D
• SPEA2
• OpenCL
• Omni-optimizer

Cites Work

• Unnamed Item
• Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem
• Nonlinear multiobjective optimization
• An efficient constraint handling method for genetic algorithms
• Very Fast Non-dominated Sorting
• Evolutionary Multi-Criterion Optimization
• Evolutionary Multi-Criterion Optimization

This page was built for publication: Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU