Parallel skeletons for tabu search method based on search strategies and neighborhood partition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2328, Issue , 2002, Pages 185-193

  Blesa, Maria J ^a   Hernàndez, Lluis ^a   Xhafa, Fatos ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

C++ (PROGRAMMING LANGUAGE); COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; MUSCULOSKELETAL SYSTEM; PARALLEL PROGRAMMING; TABU SEARCH;

0-1 MULTIDIMENSIONAL KNAPSACK PROBLEMS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMMUNICATION LIBRARY; PARALLEL IMPLEMENTATIONS; PARALLEL PROGRAMMING PARADIGMS; PARALLEL SKELETONS; SEQUENTIAL IMPLEMENTATION; TABU SEARCH METHOD;

OBJECT ORIENTED PROGRAMMING;

EID: 33748425417     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48086-2_20     Document Type: Conference Paper

References (16)

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.
2. Chu, P.C. and Beasley, J.E.: A Genetic Algorithm for the Multidimensional Knapsack Problem. (1998) Journal of Heuristics 4 63-86
3. Crainic, T.G. and Toulouse, M.: Parallel metaheuristics. Technical report, Dépt. des sciences administratives (Université du Québec a Montréal) (1997)
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)
5. Freville, A. and Plateau, G.: Hard 0-1 Multiknapsack Testproblems for Size Reduction Methods Investigacion Operativa 1 (1990) 251–270
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.
7. Glover, F.: Heuristics for Integer Programming Using Surrogate Constraints. Decision Sciences (1977) 8 156–166
8. Glover, F.: Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Op. Res. (1986) 5 533–549
9. Jörnsten, K. and Lokketangen, A.: Tabu Search for Weighted k-Cardinality Trees. Asia-Pacific J. of Op. Res. (1997) 14(2) 9–26
10. Kliewer, G. and Tschoke, S.: A General Parallel Simulated Annealing Library (parSA) and its Applications in Industry. Proc. of Pareo’98, France 1998.
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., 1997
12. Niar, S. and Hanafi, S.: Une Resolution Parallele du Probleme Sac a Dos Multidimensionnel Base sur la Recherche Tabou Univ. de Valenciennes, Nž. 95-4, 1995
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.
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–259
15. Taillard, E.: Robust Tabu Search for the Quadratic Assignment Problem. Parallel Computing (1991) 17 443–455
16. Taillard, E.: Parallel Iterative Search Methods for Vehicle Routing Problem. Networks (1993) 23 661–673