A parallel tabu search for the unconstrained ...
Type de document :
Communication dans un congrès avec actes
Titre :
A parallel tabu search for the unconstrained binary quadratic programming problem
Auteur(s) :
Shi, Jialong [Auteur]
City University of Hong Kong [Hong Kong] [CUHK]
Zhang, Qingfu [Auteur]
City University of Hong Kong [Hong Kong] [CUHK]
Derbel, Bilel [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Liefooghe, Arnaud [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
City University of Hong Kong [Hong Kong] [CUHK]
Zhang, Qingfu [Auteur]
City University of Hong Kong [Hong Kong] [CUHK]
Derbel, Bilel [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Liefooghe, Arnaud [Auteur]

Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Titre de la manifestation scientifique :
IEEE Congress on Evolutionary Computation (CEC 2017)
Ville :
Donostia - San Sebastián
Pays :
Espagne
Date de début de la manifestation scientifique :
2017-06-05
Discipline(s) HAL :
Computer Science [cs]/Operations Research [math.OC]
Mathématiques [math]/Optimisation et contrôle [math.OC]
Mathématiques [math]/Optimisation et contrôle [math.OC]
Résumé en anglais : [en]
Although several sequential heuristics have been proposed for dealing with the Unconstrained Binary Quadratic Programming (UBQP), very little effort has been made for designing parallel algorithms for the UBQP. This paper ...
Lire la suite >Although several sequential heuristics have been proposed for dealing with the Unconstrained Binary Quadratic Programming (UBQP), very little effort has been made for designing parallel algorithms for the UBQP. This paper propose a novel decentralized parallel search algorithm, called Parallel Elite Biased Tabu Search (PEBTS). It is based on D2TS, a state-of-the-art sequential UBQP metaheuristic. The key strategies in the PEBTS algorithm include: (i) a lazy distributed cooperation procedure to maintain diversity among different search processes and (ii) finely tuned bit-flip operators which can help the search escape local optima efficiently. Our experiments on the Tianhe-2 supercomputer with up to 24 computing cores show the accuracy of the efficiency of PEBTS compared with a straightforward parallel algorithm running multiple independent and non-cooperating D2TS processes.Lire moins >
Lire la suite >Although several sequential heuristics have been proposed for dealing with the Unconstrained Binary Quadratic Programming (UBQP), very little effort has been made for designing parallel algorithms for the UBQP. This paper propose a novel decentralized parallel search algorithm, called Parallel Elite Biased Tabu Search (PEBTS). It is based on D2TS, a state-of-the-art sequential UBQP metaheuristic. The key strategies in the PEBTS algorithm include: (i) a lazy distributed cooperation procedure to maintain diversity among different search processes and (ii) finely tuned bit-flip operators which can help the search escape local optima efficiently. Our experiments on the Tianhe-2 supercomputer with up to 24 computing cores show the accuracy of the efficiency of PEBTS compared with a straightforward parallel algorithm running multiple independent and non-cooperating D2TS processes.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Projet ANR :
Collections :
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-01581361/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-01581361/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-01581361/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- shi.cec2017.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- shi.cec2017.pdf
- Accès libre
- Accéder au document