Abstract
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.
Research partially supported by the IST Programme of the EU under contract IST-1999-14186 (ALCOM-FT) and the CICYT project TIC1999-0754-C03. The work of Maria J. Blesa was partially supported by the Catalan 2001FI-00659.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
Chu, P.C. and Beasley, J.E.: A Genetic Algorithm for the Multidimensional Knapsack Problem. (1998) Journal of Heuristics 4 63–86
Crainic, T.G. and Toulouse, M.: Parallel metaheuristics. Technical report, Dépt. des sciences administratives (Université du Québec a Montréal) (1997)
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)
Freville, A. and Plateau, G.: Hard 0-1 Multiknapsack Testproblems for Size Reduction Methods Investigacion Operativa 1 (1990) 251–270
Garey, M.R. and Johnson, D.S.: Computers and Intractability-A Guide to the Theory of NP-Completeness. (1979) W.H. Freeman and Co.
Glover, F.: Heuristics for Integer Programming Using Surrogate Constraints. Decision Sciences (1977) 8 156–166
Glover, F.: Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Op. Res. (1986) 5 533–549
Jörnsten, K. and Løkketangen, A.: Tabu Search for Weighted k-Cardinality Trees. Asia-Pacific J. of Op. Res. (1997) 14(2) 9–26
Kliewer, G. and Tschoke, S.: A General Parallel Simulated Annealing Library (parSA) and its Applications in Industry. Proc. of Pareo’98, France 1998.
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., 1997
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, 1995
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.
S. Porto and C. Ribeiro. A Case Study on Parallel Synchronous Implementations of Tabu Search Based on Neighborhood Decomposition. Investigacion Operativa (1996) 5 233–259
Taillard, E.: Robust Tabu Search for the Quadratic Assignment Problem. Parallel Computing (1991) 17 443–455
Taillard, E.: Parallel Iterative Search Methods for Vehicle Routing Problem. Networks (1993) 23 661–673
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blesa, M.J., Hernàndez, L., Xhafa, F. (2002). Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_20
Download citation
DOI: https://doi.org/10.1007/3-540-48086-2_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43792-5
Online ISBN: 978-3-540-48086-0
eBook Packages: Springer Book Archive