GPGPU-compatible archive based stochastic ranking evolutionary algorithm (G-ASREA) for multi-objective optimization

  • Authors:
  • Deepak Sharma;Pierre Collet

  • Affiliations:
  • LogXlabs Research Center, Paris, France;FDBT, LSIIT, Université de Strasbourg, France

  • Venue:
  • PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a GPGPU (general purpose graphics processing unit) compatible Archived based Stochastic Ranking Evolutionary Algorithm (G-ASREA) is proposed, that ranks the population with respect to an archive of non-dominated solutions. It reduces the complexity of the deterministic ranking operator from O(mn2) to O(man)* and further speeds up ranking on GPU. Experiments compare G-ASREA with a CPU version of ASREA and NSGA-II on ZDT test functions for a wide range of population sizes. The results confirm the gain in ranking complexity by showing that on 10K individuals, G-ASREA ranking is ≅ ×5000 faster than NSGA-II and ≅ ×15 faster than ASREA.