GPU-based Approaches for Multiobjective Local Search Algorithms. A Case Study: the Flowshop Scheduling Problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

GPU-based Approaches for Multiobjective Local Search Algorithms. A Case Study: the Flowshop Scheduling Problem

Résumé

Multiobjective local search algorithms are efficient methods to solve complex problems in science and industry. Even if these heuristics allow to significantly reduce the computational time of the solution search space exploration, this latter cost remains exorbitant when very large problem instances are to be solved. As a result, the use of GPU computing has been recently revealed as an efficient way to accelerate the search process. This paper presents a new methodology to design and implement efficiently GPU-based multiobjective local search algorithms. The experimental results show that the approach is promising especially for large problem instances.

Domaines

Informatique
Fichier principal
Vignette du fichier
EvoCopLuong.pdf (156.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00638811 , version 1 (07-11-2011)

Identifiants

  • HAL Id : inria-00638811 , version 1

Citer

Thé Van Luong, Nouredine Melab, El-Ghazali Talbi. GPU-based Approaches for Multiobjective Local Search Algorithms. A Case Study: the Flowshop Scheduling Problem. 11th European Conference on Evolutionary Computation in Combinatorial Optimisation, 2011, Torino, Italy. ⟨inria-00638811⟩
101 Consultations
215 Téléchargements

Partager

Gmail Facebook X LinkedIn More