Neighborhood Structures for GPU-based Local ...
Document type :
Compte-rendu et recension critique d'ouvrage
Title :
Neighborhood Structures for GPU-based Local Search Algorithms
Author(s) :
Luong, Thé Van [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Melab, Nouredine [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Talbi, El-Ghazali [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Melab, Nouredine [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Talbi, El-Ghazali [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Journal title :
Parallel Processing Letters
Pages :
307-324
Publisher :
World Scientific Publishing
Publication date :
2010
ISSN :
0129-6264
English keyword(s) :
GPU-based metaheuristics
Parallel local search algorithms on GPU
Parallel local search algorithms on GPU
HAL domain(s) :
Informatique [cs]/Autre [cs.OH]
English abstract : [en]
Local search algorithms are powerful heuristics for solving computationally hard problems in science and industry. In these methods, designing neighborhood operators to explore large promising regions of the search space ...
Show more >Local search algorithms are powerful heuristics for solving computationally hard problems in science and industry. In these methods, designing neighborhood operators to explore large promising regions of the search space may improve the quality of the obtained solutions at the expense of a high computation process. As a consequence, the use of GPU computing provides an efficient way to speed up the search. However, designing applications on GPU is still complex and many issues have to be faced. We provide a methodology to design and implement different neighborhood structures for LS algorithms on GPU. The work has been evaluated for binary problems and the obtained results are convincing both in terms of efficiency, quality and robustness of the provided solutions at run time.Show less >
Show more >Local search algorithms are powerful heuristics for solving computationally hard problems in science and industry. In these methods, designing neighborhood operators to explore large promising regions of the search space may improve the quality of the obtained solutions at the expense of a high computation process. As a consequence, the use of GPU computing provides an efficient way to speed up the search. However, designing applications on GPU is still complex and many issues have to be faced. We provide a methodology to design and implement different neighborhood structures for LS algorithms on GPU. The work has been evaluated for binary problems and the obtained results are convincing both in terms of efficiency, quality and robustness of the provided solutions at run time.Show less >
Language :
Anglais
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/inria-00520461/document
- Open access
- Access the document
- https://hal.inria.fr/inria-00520461/document
- Open access
- Access the document
- http://hal.inria.fr/docs/00/52/04/61/PDF/PPL.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- PPL.pdf
- Open access
- Access the document
- PPL.pdf
- Open access
- Access the document