Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Parallel skeletons for Tabu Search method based on search strategies and neighborhood partition

Autor
Blesa, M.; Hernàndez, L.; Xhafa, F.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2001-09
Volum
2328
Pàgina inicial
185
Pàgina final
193
DOI
https://doi.org/10.1007/3-540-48086-2_20 Obrir en finestra nova
URL
https://link.springer.com/chapter/10.1007/3-540-48086-2_20 Obrir en finestra nova
Resum
In this paper we present two parallel skeletons for Tabu Search method -a meta-heuristic for solving combinatorial optimization problems. Our parallel skeletons are designed and implemented from the generic parallel programming paradigm. The first skeleton is based on independent runs model endowed with search strategies; the second one is a master-slave model that uses neighborhood partition. In order to obtain these skeletons, we designed and implemented a sequential skeleton for the method th...
Paraules clau
Combinatorial mathematics, Optimisation, Parallel programming, Search problems
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants