Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition

  • Maria J. Blesa
  • Lluis Hernàndez
  • Fatos Xhafa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2328)


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 that is used as a basis for the two parallel skeletons. Both skeletons provide the followings: (a) permit to obtain parallel implementations of Tabu Search for concrete problems from existing sequential implementations; (b) there is no need for the user to know neither parallel programming nor communication libraries; (c) the parallel implementations for a concrete problem are obtained automatically from the existing sequential implementation for the problem. The skeletons are implemented in C++ using MPI as a communication library and offer several properties such as a genericity, flexibility, component reuse, and time savings, mainly due to the generic and object oriented programming paradigms. We have instantiated the two skeletons for the 0-1 Multidimensional Knapsack problem and report extensive experimental results.


Tabu Search Knapsack Problem Parallel Implementation Vehicle Route Problem Tabu List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blesa, M., Hernandez, Ll. and Xhafa, F.: Parallel Skeletons for Tabu Search Method. In Proc. of Int. Conf. on Parallel and Distrib. Syst. (2001) 23–28.Google Scholar
  2. 2.
    Chu, P.C. and Beasley, J.E.: A Genetic Algorithm for the Multidimensional Knapsack Problem. (1998) Journal of Heuristics 4 63–86zbMATHCrossRefGoogle Scholar
  3. 3.
    Crainic, T.G. and Toulouse, M.: Parallel metaheuristics. Technical report, Dépt. des sciences administratives (Université du Québec a Montréal) (1997)Google Scholar
  4. 4.
    Crainic, T.G., Toulouse, M. and Gendreau, M.: Towards a Taxonomy of Parallel Tabu Search Heuristics. Technical report, Dépt. d’informatique et de recherche opérationnelle. Université de Montréal (1995)Google Scholar
  5. 5.
    Freville, A. and Plateau, G.: Hard 0-1 Multiknapsack Testproblems for Size Reduction Methods Investigacion Operativa 1 (1990) 251–270Google Scholar
  6. 6.
    Garey, M.R. and Johnson, D.S.: Computers and Intractability-A Guide to the Theory of NP-Completeness. (1979) W.H. Freeman and Co.Google Scholar
  7. 7.
    Glover, F.: Heuristics for Integer Programming Using Surrogate Constraints. Decision Sciences (1977) 8 156–166CrossRefGoogle Scholar
  8. 8.
    Glover, F.: Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Op. Res. (1986) 5 533–549MathSciNetCrossRefGoogle Scholar
  9. 9.
    Jörnsten, K. and Løkketangen, A.: Tabu Search for Weighted k-Cardinality Trees. Asia-Pacific J. of Op. Res. (1997) 14(2) 9–26zbMATHGoogle Scholar
  10. 10.
    Kliewer, G. and Tschoke, S.: A General Parallel Simulated Annealing Library (parSA) and its Applications in Industry. Proc. of Pareo’98, France 1998.Google Scholar
  11. 11.
    Niar, S. and Freville, A.: A Parallel Tabu Search Algorithm for the 0-1 Multidimensional Knapsack Problem Proc. of the 11th Int. Parallel Proc. Symp., 1997Google Scholar
  12. 12.
    Niar, S. and Hanafi, S.: Une Resolution Parallele du Probleme Sac a Dos Multidi-mensionnel Base sur la Recherche Tabou Univ. de Valenciennes, Nž. 95–4, 1995Google Scholar
  13. 13.
    Porto, C.S. and Ribeiro, C.: Parallel Tabu Search message-passing Synchronous Strategies for Task Scheduling Under Procedence Constraints. Journal of Heuristics, 1(2):207–223, 1996.CrossRefGoogle Scholar
  14. 14.
    S. Porto and C. Ribeiro. A Case Study on Parallel Synchronous Implementations of Tabu Search Based on Neighborhood Decomposition. Investigacion Operativa (1996) 5 233–259Google Scholar
  15. 15.
    Taillard, E.: Robust Tabu Search for the Quadratic Assignment Problem. Parallel Computing (1991) 17 443–455MathSciNetCrossRefGoogle Scholar
  16. 16.
    Taillard, E.: Parallel Iterative Search Methods for Vehicle Routing Problem. Networks (1993) 23 661–673zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Maria J. Blesa
    • 1
  • Lluis Hernàndez
    • 1
  • Fatos Xhafa
    • 1
  1. 1.Department of LSIUPCBarcelonaSpain

Personalised recommendations